yusuke1997/dblp-id-title huggingface dataset:
Embedding First Order Predicate Logic in Fragments of Intuitionistic Logic
On the Theory of Types
Completeness of an Ancient Logic
A Formal Theory of Objects, Space and Time
On the induction schema for decidable predicates
Einkleidung der Mathematik in Schröderschen Relativkalkül
Countable Functionals and the Projective Hierarchy
Almost everywhere elimination of probability quantifiers
The Existence of Countable Totally Nonconstructive Extensions of the Countable Atomless Boolean Algebra
Countably Perfectly meager Sets
On Nonregular Ultrafilters
A Note on Universal Sets
Postulates for the Calculus of Binary Relations
Quasipolynomial Size Frege Proofs of Frankl's Theorem on the Trace of Sets
Decidability of the Almost All Theory of Degrees
A Basic Logic
Reverse mathematics and Ramsey's property for trees
Comments on a Variant Form of Natural Deduction
A Schanuel condition for Weierstrass equations
Effective Coloration
Compact Bracket Abstraction in Combinatory Logic
Htp-Complete Rings of rational numbers
n - localization property
Definability and Descent
A Construction of Superstable NDOP-NOTOP Groups
The non-compactness of square
Relativized Logspace and Generalized Quantifiers over Finite Ordered Structures
Completeness and Decidability of Tense Logics Closely Related to Logics Above K4
On a Generalization of Distributivity
Non-Constructive Galois-Tukey Connections
Vicious Circle Principle and the Paradoxes
An Improved Prenex Normal Form
Lawvere - Tierney sheaves in Algebraic Set Theory
Brouwer's Fan Theorem and convexity
Some Remarks on Definable Equivalence Relations in O-Minimal Structures
A Geometric Proof of the Completeness of the Lukasiewicz Calculus
Anti-complex sets and reducibilities with tiny use
Remarks on Identity and Description in First-Order Axiom Systems
A Note on The Isomorphism Problem for SK[G]
Definability in Functional Analysis
Expansions of geometries
Interpolation in Fragments of Classical Linear Logic
Stratified Languages
Expansions of Dense Linear Orders with The Intermediate Value Property
Uncountable Trees And Cohen $\kappa$-Reals
The Nonconstructive Content of Sentences of Arithmetic
First-order Axiomatisations of Representable Relation Algebras Need Formulas of Unbounded Quantifier depth
Zermelo-Fraenkel Consistency Results by Fraenkel-Mostowski Methods
Taxonomies of Model-Theoretically Defined Topological Properties
Bemerkungen zum Begriff der Inhaltlichen Widerspruchsfreiheit
The Computational Content of Intrinsic density
Uniqueness, Definability and Interpolation
Knaster and Friends III: Subadditive colorings
Chang's Conjecture and The Non-Stationary Ideal
On Essentially Low, Canonically Well-Generated Boolean Algebras
Parallel strategies
Admissible Suslin Cardinals in L(R)
Finite Algebras of Relations Are Representable on Finite Sets
Paires de Structures Stables
The Relative Expressive Power of Some Logics Extending First-Order Logic
Finitely generated free Heyting algebras: the well-founded initial segment
A Note On Uniform Definability and Minimal Fields of Definition
Ramsey's Theorem for Computably Enumerable Colorings
Counting Finite Models
On dp-minimality, strong dependence and weight
Countable Filters on Omega
Recursion Theory on Orderings. II
Finitely Generic Models of T UH , for Certain Model Companionable Theories T
Three Universal Representations of Recursively Enumerable Sets
On Ideals and Stationary Reflection
On the Elementary Equivalence of Automorphism Groups of Boolean Algebras; Downward Skolem Lowenheim Theorems and Compactness of Related Quantifiers
Degree Spectra of Analytic Complete Equivalence Relations
Markov's Principle, Isols and Dedekind Finite Sets
A New Proof of Sahlqvist's Theorem on Modal Definability and Completeness
The Complexity of Decision Procedures In Relevance Logic II
On Sequences Generic in the Sense of Magidor
Coding Over a Measurable Cardinal
The logic of interactive Turing reduction
Provably Total Functions of Intuitionistic Bounded Arithmetic
Stable embeddedness in algebraically closed valued fields
Diagonal Prikry extensions
Cellularity and the structure of pseudo-trees
A Remark on Martin's Conjecture
Schnorr randomness
On Simplifying the Matrix of a WFF
Bounding Minimal Degrees by Computably Enumerable Degrees
Stationary Sets and Infinitary Logic
Meeting of the Association for Symbolic Logic: New York City, May 1987
Computable Boolean Algebras
Cupping and jump Classes in the computably Enumerable Degrees
Probabilities Over Rich Languages, Testing and Randomness
Stationary Reflections and Ideals
Persistence and Herbrand Expansions
Eighteenth Meeting of the Association for Symbolic Logic
A relative of the approachability ideal, diamond and non-saturation
A Theory of Formal Truth Arithmetically Equivalent to ID 1
Initial Segments of the Degrees of Unsolvability Part II: Minimal Degrees
Ordre Fondamental D'Une Théorie 1-Basée
Intensional Models for First Degree Formulas
The Complexity of Scott Sentences of scattered linear Orders
Meeting of the Association for Symbolic Logic: Santiago, Chile, 1978
Schur-Zassenhaus Theorem Revisited
The consistency strength of choiceless failures of SCH
Asymptotic Analysis of Skolem's exponential Functions
A Sufficient Condition for Completability of Partial Combinatory Algebras
The onto Mapping of Sierpinski and Nonmeager Sets
An Existence Theorem for a Special Ultrafilter when d = c
Sequential Theories and Infinite Distributivity in the Lattice of Chapters
Expansions of the Ordered additive Group of Real numbers by two discrete Subgroups
The Independence of Peano's Fourth Axiom from Martin-Lof's Type Theory Without Universes
A Remark on Scott's Interpolation Theorem for L omega 1 omega
Idempotent Ideals on Abelian Groups
Computable Presentations of C*-Algebras
Universally Free Logic and Standard Quantification Theory
Notes on the DPRM Property for Listable Structures
Elementary Extensions of Countable Models of Set Theory
Reverse mathematics, computability, and partitions of trees
On Undecidable Statements in Enlarged Systems of Logic and the Concept of Truth
Axiom I 0 and Higher degree Theory
Some Applications of Supercompact Extender based Forcings to HOD
Existence of Prime Elements in Rings of Generalized Power Series
A System of Axiomatic Set Theory: Part IV. General Set Theory
Epistemic Set Theory is a Conservative Extension of Intuitionistic Set Theory
Elementary Intuitionistic Theories
Pseudo-Jump Operators. II: Transfinite Iterations, Hierarchies and Minimal Covers
The Decision Problem for Some Classes of Sentences Without Quantifiers
Degrees of Recursively Enumerable Sets Which Have No Maximal Supersets
Algebraic Extensions in Nonstandard Models and Hilbert's Irreducibility Theorem
On robust theorems due to Bolzano, Weierstrass, Jordan, and Cantor
On Definable Subsets of p-Adic Fields
Cofinal families of Borel equivalence relations and quasiorders
On Complete Atomic Proper Relation Algebras
Proof Systems for two-Way Modal μ -Calculus
A Dedekind-Style Axiomatization and the Corresponding Universal Property of an Ordinal Number System
Recursive Axiomatisations from separation Properties
Congruence Relations on Lattices of Recursively Enumerable Sets
The Universal Splitting Property. II
The Intersection of Nonstandard Models of Arithmetic
Uniformly Defined Descending Sequences of Degrees
Isols and the Pigeonhole Principle
Begrundung Einer Strengen Implikation
Arithmetical Problems and Recursively Enumerable Predicates
Fields with few types
Consistency Results About Filters and the Number of Inequivalent Growth Types
A Comparison of various analytic Choice Principles
New Axiomatizations of S3 and S4
An Axiomatic System for the First Order Language with an Equi-Cardinality Quantifier
The tree property and the failure of the Singular Cardinal Hypothesis at ℵ ω 2
Selection in Abstract Recursion Theory
The Equivalence of NF-Style Set Theories with "Tangled" Type Theories; The Construction of omega-Models of Predicative NF (and More)
Algebraically Closed Groups of Large Cardinality
Constructively Accessible Ordinal Numbers
Changing Cofinalities and Infinite Exponents
Ways of Destruction
Families of Ultrafilters, and Homomorphisms on Infinite Direct Product Algebras
Working below a Highly Recursively Enumerable Degree
A Probabilistic Interpolation Theorem
Cohen-Stable Families of Subsets of Integers
Hamel Spaces and distal expansions
A System of Strict Implication
On Logics Intermediate between Intuitionistic and Classical Predicate Logic
The System C triangle of Combinatory Logic
The Equivalence of a Generalized Martin's Axiom to a Combinatorial Principle
The Contributions of Alfred Tarski to Algebraic Logic
On Iterating Semiproper Preorders
Transfinite Extensions of Friedberg's Completeness Criterion
An Infinite Superstable Group Has Infinitely Many Conjugacy Classes
The Sigma 1 2 Theory of Axioms of Symmetry
Bounded modified realizability
Minimal Prime Ideals and Arithmetic Comprehension
A Maximal Bounded Forcing Axiom
Sentences of Type Theory: The Only Sentences Preserved Under Isomorphisms
A note on defining transcendentals in function fields
The amalgamation spectrum
Weak Canonical Bases in Nsop 11_1 Theories
Transfer principle in quantum set theory
Approximate counting in bounded arithmetic
Independence and Consistency Proofs in Quadratic Form Theory
The delta 0 2 -Spectrum of A Linear Order
Modest Theory of Short Chains. I
On Slupecki T-Functions
Varsovian Models I
Omitting Models
The Well-Foundedness of the Mitchell Order
Ehrenfeucht-FRAïSSé Games on a class of scattered linear Orders
On non-Compact P-ADIC Definable Groups
Symbols, Signs, and Signals
A Second Order Logic of Existence
On the Inevitability of the Consistency operator
A Strong Version of Herbrand's Theorem for Introvert Sentences
Simple and Hyperhypersimple Vector Spaces
Cantor-Bendixson Rank of The Ziegler Spectrum Over A Commutative Valuation Domain
Tense Logic for Discrete Future Time
The Thickness Lemma from P - + I Sigma 1 + not B Sigma 2
Note on an Idea of Fitch
A Generalization of Godel's Notion of Constructibility
Some Highly Saturated Models of Peano Arithmetic
Rowbottom Cardinals and Jonsson Cardinals are Almost the Same
Weak saturation and Weak Amalgamation Property
Gregory trees, the continuum, and Martin's axiom
Measures induced by units
The Consistency of Number Theory Via Herbrand's Theorem
Obligation Blackwell Games and P-Automata
Analytic Cell Decomposition and the Closure of p-adic Semianalytic Sets
Lattice initial segments of the hyperdegrees
On Subcreative Sets and S-Reducibility
The Axiomatization of Randomness
Gap-2 Morasses of Height omega
Post's Problem and His Hypersimple Set
Solution of a Problem of Leon Henkin
Storage Operators and Directed Lambda-Calculus
Boolean Combinations of R.E. Open Sets
Martin's Axiom and a Regular Topological Space with Uncountable Net Weight Whose Countable Product is Hereditarily Separable and Hereditarily Lindelof
Element and Number
A Formalisation of Referentially Opaque Contexts
Monadic Second Order Definable Relations on the Binary Tree
The pseudocompactness of [0, 1] is equivalent to the uniform continuity theorem
Principal Type-Schemes and Condensed Detachment
Strengthening prompt simplicity
Certain Predicates Defined by Induction Schemata
Wtt-Degrees and T-Degrees of R.E. Sets
Theories of Modules Closed Under Direct Products
Stone Space of cylindric Algebras and Topological Model Spaces
Generic coding with Help and Amalgamation Failure
Coding without Fine Structure
Theories of presheaf type
Elimination of Quantifiers for Ordered Valuation Rings
On Effectively Discontinuous Type-2 Objects
Located Sets and Reverse Mathematics
Intuitionistic Completeness for First Order Classical Logic
Model-Complete Theories of e-Free AX Fields
Increasing u 2 by a stationary set preserving forcing
Two-Dimensional Partial Orderings: Recursive Model Theory
A Remark on Africk's Paper on Scott's Interpolation Theorem for L omega 1 omega
Vaught's Conjecture for o-Minimal Theories
Fibered Categories and the Foundations of Naive Category Theory
Applications of Trees to Intermediate Logics
MIPC as the Formalisation of an Intuitionist Concept of Modality
Pointwise definable models of set theory
Ideal Models and Some Not so Ideal Problems in the Model Theory of L(Q)
The Undecidability of the Turing Machine Immortality Problem
Negative-Existentially Complete Structures and Definability in Free Extensions
Generalized Prime Models
A note on Σ 1 -maximal models
Periodicite Des Theories Elementaires Des Corps De Series Formelles Iterees
Pseudofinite H-Structures and Groups Definable in Supersimple H-Structures
On The Ramseyan Properties of Some Special Subsets of 2 omega and Their Algebraic Sums
The Kleene Symposium and the Summer Meeting of the Association for Symbolic Logic
Cupping and definability in the local structure of the enumeration degrees
Regular embeddings of the stationary tower and Woodin's Sigma 2 2 maximality theorem
Power-collapsing games
Universal computably Enumerable Equivalence Relations
Hierarchies of Monadic Generalized Quantifiers
Forcing Constructions for Uncountably Chromatic Graphs
Describing Ordinals Using Functionals of Transfinite Type
Smoothness of Bounded Invariant Equivalence Relations
Cardinal Collapsing and Ordinal Definability
Extensions of Some Theorems of Anderson and Belnap
The Mitchell order below rank-to-rank
Characterizing quantifier extensions of dependence logic
On the construction of effectively random sets
Priority Arguments via True stages
On the Complexity of Classifying Lebesgue Spaces
Continuum-many Boolean algebras of the form (omega )/ I , I Borel
A Model in Which Every Boolean Algebra Has Many Subalgebras
Bibliography of Alfred Tarski
The Temporal Logic of two dimensional Minkowski Spacetime is Decidable
A System of Axiomatic Set Theory - Part II
ω-stability and Morley Rank of Bilinear Maps, Rings and Nilpotent Groups
Characterizing rosy theories
On the Strength of the Sikorski Extension Theorem for Boolean Algebras
Small Theories of Boolean Ordered O-Minimal Structures
Weak representations of relation algebras and relational bases
An algebraic characterization of equivalent preferential models
Rectangular Games
How to Characterize Provably Total Functions by Local Predicativity
Canonical Forms for Definable Subsets of Algebraically Closed and Real Closed Valued Fields
On Primitive Recursive Permutations and their Inverses
Meeting of the Association for Symbolic Logic: Milwaukee, 1981
On generic structures with a strong amalgamation property
A high c.e. degree which is not the join of two minimal degrees
Hierarchies of forcing Axioms, the continuum Hypothesis and square Principles
On Reduction to a Symmetric Relation
Iterating Symmetric Extensions
Random reals, the rainbow Ramsey theorem, and arithmetic conservation
Concerning Ultrafilters on Ultrapowers
Maximal Contiguous Degrees
The Generalised RK-Order, Orthogonality and Regular Types for Modules
Projective clone Homomorphisms
Abstract Inductive and Co-Inductive Definitions
On the structure of finite level and ω-decomposable Borel functions
An Addendum: Disjunction and Existence Under Implication in Elementary Intuitionistic Formalisms
Finding descending sequences through ill-Founded linear Orders
Meeting of the Association for Symbolic Logic: Stanford, California, 1985
A L'Ouest D'Eden
On the Strong Semantical Completeness of the Intuitionistic Predicate Calculus
Higher Miller forcing May collapse Cardinals
A New Correctness Criterion for The Proof Nets of Non-Commutative Multiplicative Linear Logics
The strength of the Tree Theorem for Pairs in Reverse Mathematics
On first-order sentences without finite models
Generalizations of the One-Dimensional Version of the Kruskal-Friedman Theorems
Support Structures for the Axiom of Choice
Some Results on Measure Independent Godel Speed-Ups
Analytic Equivalence Relations and Ulm-Type Classifications
Weak squares and Very Good scales
N 0 -Categorical Modules
On the Structure of Groups endowed with a compatible C-Relation
BPFA and projective well-orderings of the reals
On Certain Types and Models for Arithmetic
On Weak Completeness of Intuitionistic Predicate Logic
Busy Beaver Sets and the Degrees of Unsolvability
Term extraction and Ramsey's theorem for pairs
A Logical and Algebraic characterization of Adjunctions between generalized quasi-Varieties
On Universal Semiregular Invariant Measures
Rich Models
Minimality and Completions of PA
Complementation in the Turing Degrees
Getting more colors I
Finitely Constrained Classes of Homogeneous Directed Graphs
Correction to "Simple R. E. Degree Structures"
Suslin forcing and parametrized diamond principles
Maximal stable Quotients of Invariant Types in NIP Theories
Epimenides the Cretan
Superatomic Boolean Algebras Constructed from Morasses
Post-Scriptum À "Théories Instables"
Souslin Forcing
Nonstandard Natural Number Systems and Nonstandard Models
A Note on Computable Real Fields
Generic substitutions
Infinitary Compactness without Strong Inaccessibility
Genericity and Randomness with Ittms
Meeting of the Association for Symbolic Logic: Bogota, Colombia, 1981
Pragmatic Truth and Approximation to Truth
A Dichotomy Theorem for Turbulence
Simple stable homogeneous groups
Dense ideals and Cardinal Arithmetic
On Weihrauch Reducibility and intuitionistic Reverse Mathematics
Surreal Ordered exponential Fields - erratum
Strongly Minimal Steiner Systems I: existence
The Name Relation and the Logical Antinomies
Separably Closed Fields with Higher Derivation I
Theories with Equational Forking
Independent Axiom Schemata for Von Wright's M
Slow P-Point Ultrafilters
Saturated Models of Peano Arithmetic
Jump operator and Yates degrees
The first-order structure of weakly Dedekind-finite sets
On Formulas of One Variable in Intuitionistic Propositional Calculus
Axiomatizing Universal Properties of Quantifiers
Fusion over sublanguages
Some Independence Results for Control Structures in Complete Numberings
Poly-Separated and omega-Stable Nilpotent Groups
Relativized Realizability in Intuitionistic Arithmetic of All Finite Types
Some Facts About Kurt Godel
A Sharp Version of the Bounded Matijasevich Conjecture and the End-Extension Problem
A Propositional Logic with Subjunctive Conditionals
Hilbert's Program and the Omega-Rule
A Generalization of Tennenbaum's Theorem on Effectively Finite Recursive Linear Orderings
Vopenka's Principle and Compact Logics
The Härtig Quantifier: A Survey
Counting the Maximal Intermediate Constructive Logics
Decidable Subspaces and Recursively Enumerable Subspaces
On the Incompleteness Theorems
Degrees of monotone complexity
On Analytic Well-Orderings
Deduction Theorems Within RM and Its Extensions
Provability in Finite Subtheories of Pa and Relative Interpretability: A Modal Investigation
Borel-amenable reducibilities for sets of reals
A Constructive Look at The Completeness of The Space D(R)
Computable Topological Groups
A hierarchy of tree-automatic structures
Recursive in A Generic Real
Non-Standard Models for Formal Logics
Subformula Theorems for N-Sequents
More Undecidable Lattices of Steinitz Exchange Systems
Reverse Mathematics of First-order Theories with Finitely Many Models
A Few Special Ordinal Ultrafilters
Finitist Axiomatic Truth
Realization of Analysis into Explicit Mathematics
Univers positifs
Uncountable Master Codes and the Jump Hierarchy
Stratification and Cut-Elimination
Self-Verifying Axiom Systems, The Incompleteness Theorem and Related Reflection Principles
The automorphism Group of the FRAïSSé Limit of finite Heyting Algebras
Indiscernable Sequences in a Model Which Fails to Have the Order Property
Partial Recursive Functions and omega-Functions
Non-Distributive Upper Semilattice of Kleene Degrees
Transfer methods for o-minimal topology
Annual Meeting of the Association for Symbolic Logic: Boston 1983
A Sequent Calculus for Type Assignment
Some Theorems About the Sentential Calculi of Lewis and Heyting
Uniform Enumeration Operations
Interpolation for First Order S5
Normality of a Filter over a Space of Partitions
Lusin-Sierpinski Index for the Internal Sets
Generix Strikes Again
On the weak non-finite cover property and the n -tuples of simple structures
Coherence and the Axioms of Confirmation
Hyperhypersimple Supersets in Admissible Recursion Theory
Partitions of Products
Positive abstraction and extensionality
Modal Reduction Principles
Bases of Countable Boolean Algebras
Projective Model Completeness
Filtering unification and most general unifiers in modal logic
The Complexity of Intrinsically R.E. Subsets of Existentially Decidable Models
Effective Model Theory vs. Recursive Model Theory
On Existence Conditions for Elements and Classes
Constructing Strongly Equivalent Nonisomorphic Models for Unsuperstable Theories, Part B
Dedekind-finite Cardinals having Countable Partitions
Where Ma First Fails
The Undecidability of Entailment and Relevant Implication
On bounded arithmetic augmented by the ability to count certain sets of primes
Addendum to Early History of the Association for Symbolic Logic
Equational Theories of Fields
The Cichon Diagram
A Complete Infinitary Logic
Structure Theory of L (ℝ, μ ) and its Applications
A Buchholz derivation system for the ordinal analysis of KP+Π 3 -reflection
Weak Partition Relations and Measurability
Ultrafilters on omega
Games and Full Completeness for Multiplicative Linear Logic
A System of Axiomatic Set Theory: Part III. Infinity and Enumerability. Analysis
Weak square bracket relations for P kappa (lambda)
Forcing the Failure of Ch by Adding a Real
On a question of Herzog and Rothmaler
Minimal Degrees and the Jump Operator
A Note on Transfinite Iteration
Calculating Self-Referential Statements: Guaspari Sentences of the First Kind
An Introduction to Hyperarithmetical Functions
Descriptive Set Theory and Harmonic Analysis
The Unsolvability of the Uniform Halting Problem for Two State Turing Machines
More on an Undecidability Result of Bateman, Jockusch and Woods
A Minimum Calculus for Logic
A Partial Model for Quine's "New Foundations"
Incompleteness Results in Kripke Semantics
Tukey order among ideals
On Recursively Enumerable and Arithmetic Models of Set Theory
On the degeneracy of the full AGM -theory of theory-revision
Inferential Equivalence and Natural Deduction
Splitting families and the Noetherian type of beta omega \\ omega
Illusory Models of Peano Arithmetic
Annual Meeting of the Association for Symbolic Logic: Karpacz, Poland 1979
Strictly positive measures on Boolean algebras
Elementary epimorphisms
Interpretability over Peano Arithmetic
Construction d'un groupe dans les structures C-minimales
Logics Without the Contraction Rule
Invariance properties of almost disjoint families
Generic Large Cardinals and Systems of filters
Binary Relational Structures Having Only Countably Many Nonisomorphic Substructures
Equivalence of Some Definitions of Recursion in a Higher Type Object
Perfect Extensions and Derived Algebras
The Consistency strength of Long Projective Determinacy
Beth Definability in Infinitary Languages
Stationary Subsets of (aleph(omega)) < omega(n)
Lower Bounds to the Size of Constant-Depth Propositional Proofs
Muchnik Degrees and cardinal characteristics
One dimensional Groups Definable in the P-ADIC numbers
Monotone Inductive Definitions over the Continuum
A short proof of the strong normalization of classical natural deduction with disjunction
Transfer and a supremum principle for ERNA
Omitting Quantifier-Free Types in Generic Structures
Forking and superstability in Tame AECS
Downward Transfer of Satisfiability for Sentences of L 1, 1
Strictly Primitive Recursive Realizability, I
Pointwise Compact and Stable Sets of Measurable Functions
Small Filter Forcing
Theories with distal Shelah expansions
Finitely Based Theories
Constructive Order Types, II
A Structure Theorem for Strongly Abelian Varieties with Few Models
Church's Thesis Without Tears
On an Ackermann-Type Set Theory
E alpha -Arithmetic and Transfinite Induction
Définissabilité dans les Corps de Fonctions p-Adiques
Henson and Rubel's theorem for Zilber's pseudoexponentiation
A Note on Quine's Principles of Quantification
Sous-groupes de Carter dans les groupes de rang de Morley fini
Structure with fast elimination of quantifiers
Combinatorial and Recursive Aspects of the Automorphism Group of the Countable Atomless Boolean Algebra