yusuke1997/dblp-id-title huggingface dataset:
The strength of choiceless patterns of singular and weakly compact cardinals
Cardinal sequences
Derived rules for predicative set theory: An application of sheaves
Repairing the interpolation theorem in quantified modal logic
Omitting types theorem in hybrid dynamic first-order logic with rigid symbols
Some lower bounds on Shelah rank in the free group
Krull dimension in set theory
Completeness and cut-elimination theorems for trilattice logics
Compactness, interpolation and Friedman's third problem
Decidability and stability of free nilpotent lie algebras and free nilpotent p-groups of finite exponent
On the Size of Closed Unbounded Sets
Linearization of Definable Order Relations
The intervals of the lattice of recursively enumerable sets determined by major subsets
Interpolants, Cut Elimination and Flow Graphs for the Propositional Calculus
A sequent calculus for relation algebras
The provably terminating operations of the subsystem PETJ of explicit mathematics
The secret life of μ -clubs
Computing Definite Logic Programs by Partial Instantiation
Typing Untyped lambda-Terms, or Reducibility Strikes Again!
Remarks on isomorphisms in typed lambda calculi with empty and sum types
The poset of all copies of the random graph has the 2-localization property
Existentially closed structures in the power of the continuum
The Covering Lemma up to a Woodin Cardinal
On Parallel Hierarchies and R i k
λ-structures and s-structures: Translating the iteration strategies
Characterizing all models in infinite cardinalities
On the Hamkins approximation property
On the computational complexity of cut-reduction
Thin equivalence relations and inner models
Effective Forcing versus Proper Forcing
Filtration-equivalent aleph 1 -separable abelian groups of cardinality aleph 1
P-measures in models without P-points
A correction to "A non-implication between fragments of Martin's Axiom related to a property which comes from Aronszajn trees"
Modal languages for topology: Expressivity and definability
Certain very large cardinals are not created in small forcing extensions
Countable Valued Fields in Weak Subsystems of Second-Order Arithmetic
Effective bounds for convergence, descriptive complexity, and natural examples of simple and hypersimple sets
Ordinal notations based on a hierarchy of inaccessible cardinals
Non-stationary support iterations of Prikry forcings and restrictions of ultrapower embeddings to the ground model
Compact spaces, elementary submodels, and the countable chain condition
Algebraic combinatorics in bounded induction
Downward categoricity from a successor inside a good frame
Model-theoretic complexity of automatic structures
Uniformly defining valuation rings in Henselian valued fields with finite or pseudo-finite residue fields
Finite undecidability in PAC and PRC fields
Fixed Points in Peano Arithmetic with Ordinals
Varieties of Complex Algebras
Analytic combinatorics, proof-theoretic ordinals, and phase transitions for independence results
Transductions in arithmetic
A New Model for Intuitionistic Analysis
Lindström theorems in graded model theory
Equational Theories for Inductive Types
Solovay's theorem cannot be simplified
What is the world of mathematics?
The complexity of central series in nilpotent computable groups
Applications of Cohomology to Set Theory II: Todorcevic Trees
Members of countable π 1 0 classes
Undecidability of L(F ∞ ) and other lattices of r.e. substructures
Concepts of general topology in constructive mathematics and in sheaves, II
An Exponential Separation Between the Parity Principle and the Pigeonhole Principle
Unifying the model theory of first-order and second-order arithmetic via
Social welfare relations and irregular sets
Unreachability of Γ+,
Order-isomorphic eta 1 -orderings in Cohen extensions
Generic Degrees are Complemented
Realization of constructive set theory into explicit mathematics: a lower bound for impredicative Mahlo universe
A Global Version of a Theorem of Ben-David and Magidor
Completeness in local positive logic
Rational Separability over a Global Field
Ind- and pro- definable sets
Saturated models of universal theories
Determinacy in the Difference Hierarchy of Co-Analytic Sets
Enumerating teams in first-order team logics
Pi 1 0 classes and orderable groups
Sets of Generators and Automorphism Bases for the Enumeration Degrees
Generalised algebraic theories and contextual categories
A Constructive Approach to Nonstandard Analysis
What's the Difference?
Ordinals and graph decompositions
The finite submodel property and omega-categorical expansions of pregeometries
The complexity of subdifferentiation and its inverse on convex functions in Banach spaces
Best Solving Modal Equations
Completeness results for memory logics
Sigma 2 Induction and Infinite Injury Priority Arguments, Part II: Tame Sigma 2 Coding and the Jump Operator
A foundation for real recursive function theory
Modules in the category of sheaves over quantales
On Grzegorczyk Induction
A Semantical Storage Operator Theorem for All Types
Decidability and the number of countable models
Large cardinals at the brink
Infinite lexicographic products
Extending Hrushovski's groupoid-cover correspondence using simplicial groupoids
Some more results on relativized Chaitin's Ω
An effective version of Wilkie's theorem of the complement and some effective o-minimality results
Linear Logic for Nets with Bounded Resources
Complexity of Equations Valid in Algebras of Relations: Part I: Strong Non-Finitizability
Erratum to "Definitional Equivalence and Algebraizability of Generalized Logical Systems"
Limit spaces with approximations
A domain model characterising strong normalisation
The Universality Spectrum of Stable Unsuperstable Theories
Ordinal analysis of non-monotone I -definable inductive definitions
The combinatorial essence of supercompactness
In Conjunction with Qualitative Probability
Linear realizability and full completeness for typed lambda-calculi
Higher Kurtz randomness
Quick cut-elimination for strictly positive cuts
Simplicity of the automorphism groups of some Hrushovski constructions
Definable Sets in Generic Complex Tori
Random expansions of finite structures with bounded degree
Basic subtoposes of the effective topos
Satisfaction of existential theories in finitely presented groups and some embedding theorems
Bi-colored expansions of geometric theories
Non-forking and preservation of NIP and dp-rank
Leibniz interpolation properties
Saturation and Stability in the Theory of Computation over the Reals
A Natural Prior Probability Distribution Derived from the Propositional Calculus
An Algebraic Theory of Normal Forms
From GTC to : Generating reset proof systems from cyclic proof systems
A non-inversion theorem for the jump operator
Partial collapses of the Sigma 1 complexity hierarchy in models for fragments of bounded arithmetic
Hierarchies of Measure-Theoretic Ultrafilters
Cardinal characteristics, projective wellorders and large continuum
Modal extension of ideal paraconsistent four-valued logic and its subsystem
Weak Presentations of Non-Finitely Generated Fields
M -separable spaces of functions are productive in the Miller model
Effective compactness and orbits of points under the isometry group
2-Minimality, jump classes and a note on natural definability
Cascades, order, and ultrafilters
Effective Inseparability in a Topological Setting
Minimal from classical proofs
Syntactic cut-elimination for common knowledge
Probabilistic temporal logic with countably additive semantics
∑ 1 1 -Formulae on finite structures
Countable algebra and set existence axioms
Inseparability in Recursive Copies
Fresh function spectra
Intrinsic reasoning about functional programs I: first order theories
Determinacy and the Sharp Functions on the Reals (Corrected Version)
Difference Sets and Computability Theory
Rules with parameters in modal logic I
First-order logical duality
A premouse inheriting strong cardinals from V
The comparison of various club guessing principles
CZF and Second Order Arithmetic
More on the weak diamond
A new model construction by making a detour via intuitionistic theories II: Interpretability lower bound of Feferman's explicit mathematics T 0
A separating hyperplane theorem, the fundamental theorem of asset pricing, and Markov's principle
Orbits of subsets of the monster model and geometric theories
Algebraic properties of the first-order part of a problem
On bi-embeddable categoricity of algebraic structures
Souslin trees and successors of singular cardinals
Recursion theorems and effective domains
Small embedding characterizations for large cardinals
Laver forcing and converging sequences
The additive mutilboxes
Polarized and focalized linear and classical proofs
On the completenes principle: A study of provability in heyting's arithmetic and extensions
A dual open coloring axiom
Equational Theory of Positive Numbers with Exponentiation is Not Finitely Axiomatizable
Axioms and (counter) examples in synthetic domain theory
On the structure of certain valued fields
Destruction or Preservation as You Like It
Determinacy in the Mitchell models
Existential Instantiation and Normalization in Sequent Natural Deduction
Representation and duality of the untyped λ-calculus in nominal lattice and topological semantics, with a proof of topological completeness
Nonbounding and Slaman Triples
Existence of many L ∞, λ -equivalent, non- isomorphic models of T of power λ
On the logical and computational properties of the Vitali covering theorem
An Omitting Types Theorem for Saturated Structures
Universal graphs and functions on ω 1
Unification types and union splittings in intermediate logics
A recursion-theoretic approach to NP
Unraveling Pi 1 1
Elementary canonical formulae: extending Sahlqvist's theorem
Organic and tight
A note on non-classical nonstandard arithmetic
The unstable formula theorem revisited via algorithms
Comparing notions of presentability in Polish spaces and Polish groups
Effectiveness in RPL, with applications to continuous logic
Separations of Theories in Weak Bounded Arithmetic
CM-triviality and relational structures
A strict implication calculus for compact Hausdorff spaces
The model N = ∪ {L[A]: A countable set of ordinals}
Discrete subspaces of countably tight compacta
Projectively Well-Ordered Inner Models
Extension of C ∞ functions in polynomially bounded o-minimal structure
A necessary and sufficient condition for embedding principally decomposable finite lattices into the computable enumerable degrees preserving greatest element
Algorithmic correspondence and canonicity for non-distributive logics
Doing logic b computer: interpolation in fragments ofinstuitionistic propositional logic
Notions around tree property 1
Tabular Degrees in alpha-Recursion Theory
Completing pseudojump operators
Addendum to "Choiceless Polynomial Time": Ann. Pure Appl. Logic 100 (1999) 141-187
Choiceless Polynomial Time
Categoricity in hyperarithmetical degrees
On the Adequacy of Representing Higher Order Intuitionistic Logic as a Pure Type System
Normal Forms for Second-Order Logic over Finite Structures, and Classification of NP Optimization Problems
Bare canonicity of representable cylindric and polyadic algebras
On gaps under GCH type assumptions
Propositional union closed team logics
The Σ 1 -provability logic of HA
Topology and measure in logics for region-based theories of space
Computable irrational numbers with representations of surprising complexity
Reverse Mathematics and Homeomorphic Embeddings
Structured Theory Presentations and Logic Representations
Constructive Compact Operators on a Hilbert Space
On hereditarily indecomposable Banach spaces
A representation theorem for measurable relation algebras
Constructions by Transfinitely Many Workers
Many countable support iterations of proper forcings preserve Souslin trees
Cardinal invariants of the continuum and combinatorics on uncountable cardinals
A correction to "concepts of general topology in constructive mathematics and in sheaves"
Quasi finitely axiomatizable totally categorical theories
Cardinal transfer properties in extender models
Truth and definite truth
Totally transcendental theories of modules: decomposition of models and types
A non-implication between fragments of Martin's Axiom related to a property which comes from Aronszajn trees
On supercompactness and the continuum function
Convergent sequences in topological groups
Patterns of Compact Cardinals
Absoluteness for the theory of the inner model constructed from finitely many cofinality quantifiers
A new characterization of supercompactness and applications
Undecidability of some elementary theories over pac fields
Isometry of Polish metric spaces
A logico-geometric comparison of coherence for non-additive uncertainty measures
Categories of models of R-mingle
Effective categoricity of equivalence structures
Tarski's theory of definability: common themes in descriptive set theory, recursive function theory, classical pure logic, and finite-universe logic
Independence over arbitrary sets in NSOP 1 theories
Ultrafilters, finite coproducts and locally connected classifying toposes
Delta 0 -Complexity of the Relation y = \prod i <= n F(i)
Elementary patterns of resemblance
Decidability of the theory of modules over Prüfer domains with dense value groups
Extensional Realizability
The complexity of first-order and monadic second-order logic revisited
Erratum to "Arity and Alternation in Second-Order Logic"
Geometry of Robinson consistency in Lukasiewicz logic
An algebraic approach to subframe logics. Intuitionistic case
Non-Axiomatizable Second Order Intuitionistic Propositional Logic
The fixed-point property for represented spaces
On middle box products and paracompact cardinals
Filters and Large Cardinals
Streamlined subrecursive degree theory
Automata techniques for query inference machines
An axiomatic approach to self-referential truth
Reasoning about equilibria in game-like concurrent systems
A Geometric Consequence of Residual Smallness
A relational semantics for parallelism and non-determinism in a functional setting
Corrigendum to "Model-completions for Abelian lattice-ordered groups with finitely many disjoint elements" [Ann. Pure Appl. Logic 170 (2019) 673-698]
Pseudo real closed fields, pseudo p-adically closed fields and NTP 2
Regular universes and formal spaces
On the geometric equivalence of algebras
Intersection theory for 0-minimal manifolds
Constructing the constructible universe constructively
Undefinability results in o-minimal expansions of the real numbers
On compactifications and the topological dynamics of definable groups
The generic filter property in nonstandard analysis
Full-splitting Miller trees and infinitely often equal reals
Delta 1 2 -Sets of Reals
A graph which embeds all small graphs on any large set of vertices
Strong conceptual completeness for first-order logic
Smooth Categories and Global square
k -bounded exponential-logarithmic power series fields
On the Presburger fragment of logics with multiteam semantics
Intermediate logics and factors of the Medvedev lattice
Generalizing the Mahlo Hierarchy, with Applications to the Mitchell Models
Uniform interpolation and the existence of sequent calculi
Positive modal logic beyond distributivity
A finitary Kronecker's lemma and large deviations in the strong law of large numbers on Banach spaces
Fraïssé sequences: category-theoretic approach to universal homogeneous structures
Petri Nets, Horn Programs, Linear Logic and Vector Games
Tameness, uniqueness triples and amalgamation
Mittag-Leffler Modules
Constructive Modal Logics I
Type theories, toposes and constructive set theory: predicative aspects of AST
Superstability from categoricity in abstract elementary classes
Why Y-c.c
Stability among r.e. Quotient Algebras
Some higher-gap examples in combinatorial set theory
Tarski's definition and truth-makers
Extremes in the Degrees of Inferability
Mitchell's theorem revisited
The Set-Cover game and non-measurable unions
Fregean logics
Kripke models for classical logic
On well-generated Boolean algebras
Possible Degrees in Recursive Copies
On the existence of skinny stationary subsets
Polynomial-Time versus Recursive Models
Cardinal sequences of LCS spaces under GCH
Inside the Muchnik degrees I: Discontinuity, learnability and constructivism
Syntax for split preorders
An Undecidability Theorem for Lattices Over Group Rings
The three dimensions of proofs
Infinitesimal Approach of Almost-Automorphic Functions
The relational model is injective for multiplicative exponential linear logic (without weakenings)
On phase semantics and denotational semantics: the exponentials
Forcing absoluteness and regularity properties
Glivenko theorems revisited
Diamond (on the regulars) can fail at any strongly unfoldable cardinal
Game Sentences and Ultrapowers
Derivatives of normal functions in reverse mathematics
Effective topological spaces III: Forcing and definability
Relating word and tree automata
A generalization of the Second Incompleteness Theorem and some exceptions to it
Henkin sentences and local reflection principles for Rosser provability
Terminal notions in set theory
The spectrum of maximal independent subsets of a Boolean algebra
Equilibrium semantics of languages of imperfect information
Elementary Descent Recursion and Proof Theory
Perfect tree forcings for singular cardinals
Induction Rules, Reflection Principles, and Provably Recursive Functions
AF-algebras with lattice-ordered K 0 : Logic and computation
Diagonalization of continuous matrices as a representation of intuitionistic reals
A Study of Singular Points and Supports of Measures in Reverse Mathematics
Hilbert-style axiomatization of first-degree entailment and a family of its extensions
Globalization of intui tionistic set theory
Safe recursion with higher types and BCK-algebra
Partition relations for kappa-normal ideals on P kappa (lambda)
Polarized partitions on the second level of the projective hierarchy
Consistency, optimality, and incompleteness
Canonical forking in AECs
Separating families and order dimension of Turing degrees
Duality, projectivity, and unification in Łukasiewicz logic and MV-algebras
Classes and truths in set theory
Interpretability in PRA
Bounded arithmetic and truth definition
Independence, order, and the interaction of ultrafilters and theories
A constructive theory of continuous domains suitable for implementation
A Type-Free System Extending (ZFC)
Simple stable homogeneous expansions of Hilbert spaces
Periodicity based decidable classes in a first order timed logic
Coherence for star-autonomous categories
On expansions of the real field by complex subgroups
Formalizing Forcing Arguments in Subsystems of Second-Order Arithmetic
A proof-theoretic account of classical principles of truth
A generalization of Whitehead's problem and its independence
Independent Axiomatizability of Sets of Sentences
Around definable types in p-adically closed fields
Canonical Models for N 1 -Combinatorics
The tree property at double successors of singular cardinals of uncountable cofinality
First order logic without equality on relativized semantics
Lattices of c-degrees
Effective results on a fixed point algorithm for families of nonlinear mappings
Category-theoretic aspects of abstract elementary classes
Definable functions continuous on curves in o-minimal structures
On two topological cardinal invariants of an order-theoretic flavour
Pi 0 a Classes and Minimal Degrees
Non-deterministic semantics for dynamic topological logic
A second-order system for polytime reasoning based on Grädel's theorem
Linear Läuchli Semantics
Unified inverse correspondence for LE-logics
A nonconservativity result on global choice
Model-theoretic K1 of free modules over PIDs
Call-by-name reduction and cut-elimination in classical logic
Non decomposable connectives of linear logic
A Tribute to Dirk van Dalen - Preface
A Game Semantics for Linear Logic
The number of axioms
Generic objects in recursion theory II: Operations on recursive approximation spaces
Reducts of the Henson graphs with a constant
On definable Skolem functions and trichotomy
A Transfer Theorem in Constructive p-adic Algebra
Classifying torsion free groups in o-minimal expansions of real closed fields
Generic multiplicative endomorphism of a field
Systems of Combinatory Logic Related to Quine's 'New Foundations'
Introduction to clarithmetic III
Boolean Pairs Formed by the Delta 0 n -Sets
Canonical structure in the universe of set theory: part one
Light linear logics with controlled weakening: Expressibility, confluent strong normalization
To Preference via Entrenchment
Beth definability and the Stone-Weierstrass Theorem
Alternating (In)Dependence-Friendly Logic
Every Borel Function is Monotone Borel
On Winning Ehrenfeucht Games and Monadic NP
Kripke semantics for provability logic GLP
An Efimov space with character less than s
Recursively rigid Boolean algebras
A reducibility related to being hyperimmune-free
Polymorphic Extensions of Simple Type Structures - With an Application to Bar Recursive Minimization
On Completeness and Cocompleteness in an Around Small Categories
A strong antidiamond principle compatible with CH
Weaker cousins of Ramsey's theorem over a weak base theory
Cobham recursive set functions
Products of Menger spaces: A combinatorial approach
A remark on equivalent Rosser sentences
Reverse Mathematics and parameter-free Transfer
Strongly Determined Types
Tame topology in Hensel minimal structures
Corrigendum to "Advice classes of parameterized tractability" [Ann. Pure Appl. Logic 84 (1) (1997) 119-138]
On bounded functional interpretations
On cardinal invariants related to Rosenthal families and large-scale topology
Simple Theories
Algorithmic uses of the Feferman-Vaught Theorem
Symbioses between mathematical logic and computer science
Projective Subsets of Separable Metric Spaces
Recursive Properties of Relations on Models
Bounded linear-time temporal logic: A proof-theoretic investigation
The expressive power of k -ary exclusion logic
Effective topological spaces I: a definability theory
McNaughton Games and Extracting Strategies for Concurrent Programs
Strong normalization results by translation
On the ideal J [ κ ]
Infinitely Peano differentiable functions in polynomially bounded o-minimal structures
Borel sets without perfectly many overlapping translations, III
The set of the true regular protothetics formulas with partially ordered quantifiers is NEXPTIME-complete
Local coherence
Empty intervals in the enumeration degrees
The parameterized complexity of maximality and minimality problems
Enumerations in computable structure theory
Non-forking frames in abstract elementary classes
An arithmetical view to first-order logic
A micrological study of negation
Model Completions, r-Heyting Categories
Logic of Proofs
Remarks on generic stability in independent theories
Structure and Definability in General Bounded Arithmetic Theories
Borel Partitions of Infinite Subtrees of a Perfect Tree
Realizing Brouwer's Sequences
On p-Reducibility of Numerations
Ramsey classes of topological and metric spaces
A blend of methods of recursion theory and topology
Weak saturation properties and side conditions
Conservative translations
Automatic models of first order theories
A small complete category
Functional representation of finitely generated free algebras in subvarieties of BL-algebras
Universes over Frege structures
The intermediate value theorem in constructive mathematics without choice
Two-cardinal ideal operators and indescribability
Degree theory on aleph ω
Nonstandardness and the bounded functional interpretation
Functional interpretation of Aczel's constructive set theory
On superstable CSA-groups
A Minkowski type duality mediating between state and predicate transformer semantics for a probabilistic nondeterministic language
Mild parametrizations of power-subanalytic sets
Maximal pairs of c.e. reals in the computably Lipschitz degrees
Representing definable functions of HA ω by neighbourhood functions
On minimal flows and definable amenability in some distal NIP theories
Complexity of syntactical tree fragments of Independence-Friendly logic
Bilinear spaces over a fixed field are simple unstable
Partition relations on a plain product order type
Regularity Properties for Dominating Projective Sets
Foundations of iterated star maps and their use in combinatorics