yusuke1997/dblp-id-title huggingface dataset:
Recursive and Nonextendible Functions over the Reals; Filter Foundation for Recursive Analysis, II
On the structure of Borel ideals in-between the ideals ED and Fin ⊗ Fin in the Katětov order
A consistency result on long cardinal sequences
On Tarski's contribution to the additive measure theory and its consequences
Modal logics over lattices
Preserving levels of projective determinacy by tree forcings
Dp-finite fields I(A): The infinitesimals
Weak elimination of imaginaries for Boolean algebras
Coercion completion and conservativity in coercive subtyping
A note on a theorem of Ax
Finite Notations for Infinite Terms
The Proper Forcing Axiom, Prikry forcing, and the Singular Cardinals Hypothesis
Global and local admissibility: II. Major subsets and automorphisms
Lower complexity bounds in justification logic
Weak Axioms of Determinacy and Subsystems of Analysis II (Sigma 0 2 Games)
About Prikry Generic Extensions
Resolution over linear equations modulo two
Subtle cardinals and linear orderings
A general theory of confluent rewriting systems for logic programming and its applications
Compactly generated Hausdorff locales
Algebraic properties of rings of generalized power series
Towards the entropy-limit conjecture
A decomposition theorem for neutrices
Set existence axioms for general (not necessarily countable) stability theory
Index Sets for Pi 0 1 Classes
Logical problems of functional interpretations
Strong minimal pairs in the enumeration degrees
Recursive coloration of countable graphs
Reverse mathematics and well-ordering principles: A pilot study
On NP-Completeness in Linear Logic
Semi-Cohen Boolean Algebras
The expressive power of Malitz quantifiers for linear orderings
An application of tarskis principle to absolute Galois groups of function fields
Context-Sensitive Transitive Closure Operators
Neostability in countable homogeneous metric spaces
Dynamic measure logic
Nonstandard proof methods in toposes
Clustered cell decomposition in P-minimal structures
Banach-Stone-like results for combinatorial Banach spaces
Arity and Alternation in Second-Order Logic
Criterion for binarity of N 0 -categorical weakly o-minimal theories
Expansions of o-minimal structures by dense independent sets
On the Provability Logic of Bounded Arithmetic
Model theory for L ∞ ω 1
Metric spaces in synthetic topology
Positivity relations on a locale
Building independence relations in abstract elementary classes
A Non-Generic Real Incompatible with 0 #
On the expressibility and the computability of untyped queries
Unprovability threshold for the planar graph minor theorem
On Stably Pointed Varieties and Generically Stable Groups in ACVF
The DeMorganization of a locale
On the T 1 axiom and other separation properties in constructive point-free and point-set topology
Back and Forth Relations for Reduced Abelian p-Groups
Constructing Strongly Equivalent Nonisomorphic Models for Unstable Theories
Model theoretic dynamics in Galois fashion
On the programs-as-formulas interpretation of parallel programs in peano arithmetic
Large cardinals need not be large in HOD
Erratum to "State-morphism MV-algebras" [Ann. Pure Appl. Logic 161 (2009) 161-173]
The internal consistency of Easton's theorem
Notions of Density That Imply Representability in Algebraic Logic
On Recursively Enumerable Structures
Cone avoidance and randomness preservation
Another extension of Van de Wiele's theorem
Unrecognizability of manifolds
Dense metrizability
Effective completeness theorems for modal logic
On eigenvectors, approximations and the Feynman propagator
Higher dimensional cardinal characteristics for sets of functions
Ternary relations and relevant semantics
Regularity properties of definable sets of reals
Nonconvergence, undecidability, and intractability in asymptotic problems
Aronszajn trees on aleph 2 and aleph 3
View-Based Explicit Knowledge
Turing meets Schanuel
Low-distortion embeddings of infinite metric spaces into the real line
Product-free Lambek calculus is NP-complete
Computability of finite-dimensional linear subspaces and best approximation
On arithmetical completeness of the logic of proofs
The envelope of a pointclass under a local determinacy hypothesis
Erratum to "Computable Isomorphisms, Degree Spectra of Relations, and Scott Families"
Prefixed tableaus and nested sequents
Boolean valued semantics for infinitary logics
Schmerl decompositions in first order arithmetic
Cut-free formulations for a quantified logic of here and there
Arithmetical complexity of fuzzy predicate logics - A survey II
B-frame duality
Erratum to "Free abelian lattice-ordered groups" [Ann. Pure Appl. Logic 134 (2-3) (2005) 265-283]
Ordinal notations and well-orderings in bounded arithmetic
Strongly uniform bounds from semi-constructive proofs
Behaviorism and Belief
Expressive equivalence of least and inflationary fixed-point logic
Some Results on Cut-Elimination, Provable Well-Orderings, Induction, and Reflection
Indestructibility of ideals and MAD families
Phase transitions for Gödel incompleteness
Recursive linear orders with recursive successivities
Infinite Combinatorics and Definability
Several notes on the power of Gomory-Chvátal cuts
The Woods-Erdös conjecture for polynomial rings
WKL 0 and induction principles in model theory
SH plus CH does not imply stationary antichains
The Suslin operator in applicative theories: Its proof-theoretic analysis via ordinal theories
The logic of justified belief, explicit knowledge, and conclusive evidence
Extending Partial Orders to Dense Linear Orders
Martin-Löf randomness and Galton-Watson processes
Linear Independence without Choice
Coding true arithmetic in the Medvedev degrees of Π 1 0 classes
Semisimple Stable and Superstable Groups
A term calculus for (co-)recursive definitions on streamlike data structures
Total Sets and Objects in Domain Theory
Light Dialectica revisited
Generic Structures and Simple Theories
The Continuity of Cupping to 0'
Vaught's conjecture for monomorphic theories
The relative strengths of fragments of Martin's axiom
Term Rewriting Theory for the Primitive Recursive Functions
Generalisations of stationarity, closed and unboundedness, and of Jensen's □
Changing the Heights of Automorphism Towers
Posets of copies of countable scattered linear orders
Elementary recursive quantifier elimination based on Thom encoding and sign determination
Quelques effets pervers de la positivité
Amorphous sets and dual Dedekind finiteness
The partial orderings of the computably enumerable ibT-degrees and cl-degrees are not elementarily equivalent
Splitting families and forcing
Reduction of finite and infinite derivations
Ultrafilters and types on models of arithmetic
Triposes, q-toposes and toposes
Posets of copies of countable ultrahomogeneous tournaments
Turing degrees of hypersimple relations on computable structures
A coverage construction of the reals and the irrationals
The sequentially realizable functionals
Intuitionistically provable recursive well-orderings
Unprovability of Consistency Statements in Fragments of Bounded Arithmetic
The double negation of the intermediate value theorem
Upper and lower Ramsey bounds in bounded arithmetic
Concerning Keisler measures over ultraproducts
Theories without the tree property of the second kind
Nonstandard Definability
On the Automorphism Groups of Finite Covers
A topological characterization of (λ, μ) * -compactness
Dynamic extensions of arrow logic
Infinite games specified by 2-tape automata
First-order theories of subgroups of divisible Hahn products
Coalgebras in a category of classes
Partial near supercompactness
Almost new pre-apartness from old
Double helix in large large cardinals and iteration of elementary embeddings
A lemma for cost attained
The distribution of ITRM-recognizable reals
Canonical extensions for congruential logics with the deduction theorem
On the Complexity of Finding the Chromatic Number of a Recursive Graph II: The Unbounded Case
Skew confluence and the lambda calculus with letrec
Generalized independence
Small cardinals and small Efimov spaces
Characterizing weak compactness
On guessing generalized clubs at the successors of regulars
Reflection algebras and conservation results for theories of iterated truth
Reflection and forcing in E-recursion theory
Transfer Theorems for pi-Monads
Finite Covers with Finite Kernels
Continuum many different things: Localisation, anti-localisation and Yorioka ideals
On Borel Ideals
Characterising dominated weak-operator continuous functionals on subspaces of B ( H )
Expansions of the Real Field with Power Functions
Algorithmic randomness, reverse mathematics, and the dominated convergence theorem
First-order definitions of rational functions and s-integers over holomorphy rings of algebraic functions of characteristic 0
Easton's theorem and large cardinals
The Axioms of Constructive Geometry
Monadic theory of order and topology in ZFC
Algebraic description of limit models in classes of abelian groups
On-Dimensional Groups over an o-Minimal Structure
Erratum to "Categoricity in abstract elementary classes with no maximal models" [Ann. Pure Appl. Logic 141 (2006) 108-147]
Reasoning about proof and knowledge
Epistemic and intuitionistic formal systems
A problem of Laczkovich: How dense are set systems with no large independent sets?
Ordered transexponential fields
An approach to deciding the observational equivalence of Algol-like languages
The differential of probabilistic entailment
Remarks on Elementary Duality
Syntactic cut-elimination for a fragment of the modal mu-calculus
Introduction to computability logic
Gödel on Tarski
Cupping and Noncupping in the Enumeration Degrees of Sigma 2 0 Sets
Computing coproducts of finitely presented Gödel algebras
Borel Equivalence Relations and Classifications of Countable Models
Weakly Minimal Formulas: A Global Approach
First order theory of cyclically ordered groups
Ehrenfeucht Games and Ordinal Addition
On Kripke completeness of modal predicate logics around quantified K5
Extensions of Solovay's system S without independent sets of axioms
Tarski's theorem on intuitionistic logic, for polyhedra
Complemented sublocales and open maps
Uniform Proofs as a Foundation for Logic Programming
Completeness Results for Intuitionistic and Modal Logic in a Categorical Setting
Propositional interval neighborhood logics: Expressiveness, decidability, and undecidable extensions
Set recursion and Πhalf-logic
Decidability of the theory of modules over commutative valuation domains
Topology and duality in modal logic
Shelah's pcf Theory and Its Applications
The members of thin and minimal classes, their ranks and Turing degrees
Preface - Logic Colloquium '94, 21-30 July 1994, Clermont-Ferrand, France
Softness of hypercoherences and MALL full completeness
Interpreting N in the computably enumerable weak truth talble degrees
Perfect measurable spaces
Nonstandard Arithmetic of Hilbert Subsets
Topological completeness of the provability logic GLP
Forcing axioms and the uniformization-property
Completion of choice
The formal verification of the ctm approach to forcing
Regular projections in o-minimal structures
Petr Vopenka ( * 16.5.1935)
Thorn independence in the field of real numbers with a small multiplicative group
Projective Uniformization Revisited
A Lindström theorem for intuitionistic first-order logic
Geometric triviality of the strongly minimal second Painlevé equations
Iterated Extended Ultrapowers and Supercompactness without Choice
Indestructibility properties of Ramsey and Ramsey-like cardinals
The Bolzano-Weierstrass Theorem is the jump of Weak Kőnig's Lemma
Superstable groups of finite rank without pseudoplanes
A note on μ -stabilizers in ACVF
A descending chain condition for groups definable in o -minimal structures
What is o-minimality?
Indestructible strong compactness but not supercompactness
Reflections on function spaces
The universal modality, the center of a Heyting algebra, and the Blok-Esakia theorem
Characterizing Language Identification in Terms of Computable Numberings
Probability logic with conditional expectation
A Lipschitz determinacy principle equivalent to weak König lemma
Nonstandard arithmetic and recursive comprehension
The Joint Embedding Property in Normal Open Induction
Construction schemes: Transferring structures from ω to ω1
Extracting the resolution algorithm from a completeness proof for the propositional calculus
Ten Questions and One Problem on Fuzzy Logic
Dominating the Erdős-Moser theorem in reverse mathematics
Simple-like independence relations in abstract elementary classes
Non-commutative logical algebras and algebraic quantales
Preface: A Selection of Papers Presented at the "Stability in Model Theory III" Conference
Stability of recursive structures in arithmetical degrees
Finitary unification in locally tabular modal logics characterized
Predicative Functionals and an Interpretation of ID <omega
Completeness theorems for σ -additive probabilistic semantics
Some intuitionistic equivalents of classical principles for degree 2 formulas
Foreword for special issue of APAL for GaLoP 2013
Coherent Sequences versus Radin Sequences
A Method to Single out Maximal Propositional Logics with the Disjunction Property I
Constructive strong regularity and the extension property of a compactification
Characterizations of Realizable Space Complexities
Functional Interpretations of Feasibly Constructive Arithmetic
Remarks in abstract model theory
Strong normalization of classical natural deduction with disjunctions
Uniform interpolation and coherence
On subvarieties of symmetric closure algebras
Arithmetical completeness theorems for monotonic modal logics
Covering a Function on the Plane by Two Continuous Functions on an Uncountable Square - the Consistency
Structure Theorems for o-Minimal Expansions of Groups
Cut Normal Forms and Proof Complexity
Natural factors of the Muchnik lattice capturing IPC
Conditional algebras
Apartness spaces as a framework for constructive topology
Fundamental group in o-minimal structures with definable Skolem functions
Ceres in intuitionistic logic
Space of valuations
Almost o-minimal structures and X-structures
Logic Programs, Well-Orderings, and Forward Chaining
On the Proof Theory of Coquand's Calculus of Constructions
Imaginaries in bounded pseudo real closed fields
Rules with parameters in modal logic II
Logic of secrets in collaboration networks
A finitization of Littlewood's Tauberian theorem and an application in Tauberian remainder theory
Omitting uncountable types and the strength of [0, 1]-valued logics
On lhd * -maximality
Lyndon interpolation theorem of instantial neighborhood logic - constructively via a sequent calculus
On N 0 -Categorical Weakly o-Minimal Structures
Truth in generic cuts
CZF does not have the existence property
A completeness proof for adapted probability logic
Domain Representability of Metric Spaces
Focussing and proof construction
Continuous normalization for the lambda-calculus and Gödel's
On the complexity of the Leibniz hierarchy
Supercompact extender based Magidor-Radin forcing
Towards characterizing the >ω2-fickle recursively enumerable Turing degrees
Hypersequent calculi for intuitionistic logic with classical atoms
Linear temporal logic with until and next, logical consecutions
Non-commutative proof construction: A constraint-based approach
Some Principles Related to Chang's Conjecture
Preface: Special Issue of Papers from the Conference on Proof Theory, Provability Logic, and Computation, Berne, Switzerland, 20-24 March 1994
Refined program extraction form classical proofs
Failure of the Blok-Esakia Theorem in the monadic setting
Diophantine equations in fragments of arithmetic
Friedberg Splittings of Recursively Enumerable Sets
A classification of orbits admitting a unique invariant measure
lambda-structures and s-structures: Translating the models
Non-Commutative Logic I: The Multiplicative Fragment
Undimensional Theories are Superstable
Monadic logic and löwenheim numbers
A completeness result for a realisability semantics for an intersection type system
A note on Erdős-Hajnal property for graphs with VC dimension ≤2
Generalizations of the Kunen inconsistency
Intermediate models of Magidor-Radin forcing-Part II
The cardinals below |[omega 1 ] <omega 1 |
Definability in the h-quasiorder of labeled forests
Axiomatizing first-order consequences in dependence logic
Isolated maximal d.r.e. degrees
A game semantics for generic polymorphism
Continuity of capping in C bT
Lindenbaum algebras of intuitionistic theories and free categories
Suslin's Hypothesis Does Not Imply Stationary Antichains
Scattered Toposes
Determinate logic and the Axiom of Choice
I classes, LR degrees and Turing degrees
Reductions between types of numberings
Categoricity in abstract elementary classes with no maximal models
Infinitesimal analysis without the Axiom of Choice
Forcing by non-scattered sets
Intervals and Sublattices of the r.e. Weak Truth Table Degrees, Part II: Nonbounding
Locally compact, ω 1 -compact spaces
Natural Deduction for Intuitionistic Linear Logic
A Construction of Boolean Algebras from First-Order Structures
Asymptotic conditional probabilities for binary probability functions
Systems of Explicit Mathematics with Non-Constructive µ-Operator, Part I
Adding clubs with square
Separation results for the size of constant-depth propositional proofs
Combining Type Disciplines
Classifying Totally Categorical Groups (and Others)
Superrosy dependent groups having finitely satisfiable generics
Computability-theoretic categoricity and Scott families
Elementary analytic functions in VTC0
The automorphism group of the enumeration degrees
Mutually embeddable models of ZFC
Embedding sheaf models for set theory into boolean-valued permutation models with an interior operator
Reverse mathematical bounds for the Termination Theorem
Definability and decidability in infinite algebraic extensions
Paris-Harrington principles, reflection principles and transfinite induction up to ε 0
The Peirce translation
Iterated elementary embeddings and the model theory of infinitary logic
Sandwiches of ages
Epsilon substitution for first- and second-order predicate logic
Generalized halfspaces in dimension groups
Sparse Parameterized Problems
Integration in algebraically closed valued fields
More game-theoretic properties of boolean algebras
Descriptive complexity of topological invariants
The Dyck and the Preiss separation uniformly
Complexity of t-tautologies
A sorting network in bounded arithmetic
Global square sequences in extender models
Characterizations of ordinal analysis
Lattice properties of congruences for stochastic relations
Strongly compact cardinals and the continuum function
Almost free groups and long Ehrenfeucht-Fraïssé games
Intuitionism and the liar paradox
Inner models in the region of a Woodin limit of Woodin cardinals
Quasi-Polish spaces
Inductive definitions over a predicative arithmetic
Game ideals
Popa Superrigidity and countable Borel equivalence relations
Relative and modified relative realizability
Decidable fragment of first-order temporal logics
The predicative Frege hierarchy
Reverse mathematics and properties of finite character
Symmetric Submodels of a Cohen Generic Extension
Borel separability of the coanalytic Ramsey sets
The real-algebraic structure of Scott's model of intuitionistic analysis
The Number of Types in Simple Theories
A Strong Boundedness Theorem for Dilators
A Theory of Hyperfinite Sets
Quasi-apartness and neighbourhood spaces
A minimal classical sequent calculus free of structural rules
Cardinal characteristics and projective wellorders
Resource modalities in tensor logic
The provably total NP search problems of weak second order bounded arithmetic
Equivalents of the (Weak) Fan Theorem
The saturation of club guessing ideals
Critical Points in an Algebra of Elementary Embeddings
Slow reflection
Superstability, noetherian rings and pure-semisimple rings
Multi-posets in algebraic logic, group theory, and non-commutative topology
On church's formal theory of functions and functionals: The λ-calculus: connections to higher type recursion theory, proof theory, category theory
Definable E0 classes at arbitrary projective levels
Reduction of higher type levels by means of an ordinal analysis of finite terms
Labelling Systems and r.e. Structures
Henselianity in the language of rings
Second-order propositional modal logic and monadic alternation hierarchies
Semantics of Weakening and Contraction
On the Mitchell and Rudin-Kiesler orderings of ultrafilters
Saturated Filters at Successors of Singulars, Weak Reflection and Yet Another Weak Club Principle
An undecidable extension of Morley's theorem on the number of countable models
Elementary equivalences and accessible functors
Partial Horn logic and cartesian categories
Domain Interpretations of Martin-Löf's Partial Type Theory
Complementing cappable degrees in the difference hierarchy
The combinatorics of splittability
Index sets in the arithmetical Hierarchy
Complementing below recursively enumerable degrees
Spaces of orders and their Turing degree spectra
Generating ideals by additive subgroups of rings
On free annotated algebras
Iterating ordinal definability
Tight stationarity and tree-like scales
Trees and Ehrenfeucht-Fraïssé Games
Four cardinals and their relations in ZF
A Necessary and Sufficient Condition for Embedding Ranked Finite Partial Lattices into the Computably Enumerable Degrees
Admissibility of Π 2 -Inference Rules: interpolation, model completion, and contact algebras
Martin's Axiom and embeddings of upper semi-lattices into the Turing degrees
Applicative theories for the polynomial hierarchy of time and its levels
Coalgebraic Logic
Towards logical foundations for probabilistic computation
Logarithmic-exponential series
Independence and the finite submodel property
Triviality, NDOP and Stable Varieties
Fundamental sequences and fast-growing hierarchies for the Bachmann-Howard ordinal
Topics in invariant descriptive set theory
Undecidability through Fourier series
Dichotomy theorems for countably infinite dimensional analytic hypergraphs
Models of arithmetic and categories with finiteness conditions
The Borel complexity of von Neumann equivalence
Good projective witnesses
The core model for almost linear iterations
Dynamical method in algebra: effective Nullstellensätze
Split BN-pairs of finite Morley rank
Some theorems on the algorithmic approach to probability theory and information theory: (1971 Dissertation directed by A.N. Kolmogorov)
On strongly jump traceable reals
Closed Measure Zero Sets
CERES in higher-order logic
On the Relation between Elementary Partial Difference Equations and Partial Differential Equations
True cofinality and bounding number for small products of partial orders
Alternatives to the Halpern-Läuchli theorem
Constructing omega-stable structures: model completeness
The computational strength of matchings in countable graphs
First-order reasoning and efficient semi-algebraic proofs
Algorithmically random series and Brownian motion
Dimension of Definable Sets, Algebraic Boundedness and Henselian Fields
μ-clubs of P(λ): Paradise in heaven
Uniformly defining p-henselian valuations
Combinatorial Principle in the Core Model for one Woodin Cardinal
Supercomplete extenders and type 1 mice: Part I
The Negation of the Singular Cardinal Hypothesis from o(k) = k ++
Isolated d.c.e. degrees and Σ1 induction
Combining control effects and their models: Game semantics for a hierarchy of static, dynamic and delimited control effects
Interpreting True Arithmetic in the Theory of the r.e. Truth Table Degrees
Definable Homomorphisms of Abelian Groups in oMminimal Structures
Possible Degrees in Recursive Copies II
Model theory of special subvarieties and Schanuel-type conjectures
A geometrical procedure for computing relaxation
Universality, optimality, and randomness deficiency
Simplifying von Plato's Axiomatization of Constructive Apartness Geometry
The Recursively Enumerable Degrees have Infinitely Many One-Types
Erratum to "On the reflection invariance of residuated chains" [Ann. Pure Appl. Logic 161 (2009) 220-227]
On the impossibility of explicit upper bounds on lengths of some provably finite algorithms in computable analysis
Proof theory in the abstract
There is No Fat Orbit
Church-Rosser property of a simple reduction for full first-order classical natural deduction