yusuke1997/dblp-id-title huggingface dataset:
Model-completeness and decidability of the additive structure of integers expanded with a function for a Beatty sequence
The determinacy strength of Pi 1 2 -comprehension
Possible Behaviours for the Mitchell Ordering
Extension of Gurevich-Harrington's Restricted Memory Determinacy Theorem: A Criterion for the Winning Player and an Explicit Class of Winning Strategies
On modal logic of deductive closure
A characterization of the Language Invariant families satisfying Spectrum Exchangeability in Polyadic Inductive Logic
Intuitionistic logic and modality via topology
Fundamental sequences based on localization
On the strength of dependent products in the type theory of Martin-Löf
Decidable and undecidable prime theories in infinite-valued logic
Kurepa trees, continuous images, and perfect set properties
K-continuous lattices and comprehension principles for frege structures
What can be efficiently reduced to the Kolmogorov-random strings?
Remarks on applicative theories
Between Galois connections and (some metamathematical) solutions of equations fgf = f and gfg = g
Reasoning with belief functions over Belnap-Dunn logic
A game semantics of names and pointers
A logical approach to context-specific independence
Separating weak α -change and α -change genericity
Alternating automata and temporal logic normal forms
Introduction to Turing categories
Some applications of mixed support iterations
Unifying sets and programs via dependent types
A new model construction by making a detour via intuitionistic theories IV: A closer connection between KPω and BI
Atomicity, coherence of information, and point-free structures
Definability Hierarchies of Generalized Quantifiers
On non-abelian C-minimal groups
Diophantine Undecidability in Some Rings of Algebraic Numbers of Totally Real Infinite Extensions of Q
Generalizing Classical and Effective Model Theory in Theories of Operations and Classes
Exponentially closed fields and the conjecture on intersections with tori
Fixed-point extensions of first-order logic
Henkin quantifiers and complete problems
Systems of Combinatory Logic Related to Predicative and 'Mildly Impredicative' Fragments of Quine's 'New Foundations'
Cohen-like first order structures
Tableaux and hypersequents for justification logics
Compactness and Normality in Abstract Logics
A constructive analysis of learning in Peano Arithmetic
Decidability Problems in Languages with Henkin Quantifiers
Maslov's Inverse Method and Decidable Classes
23rd Workshop on Logic, Language, Information and Computation - WoLLIC 2016
Some Combinatorial Principles Equivalent to Restrictions of Transfinite Induction up to Gamma 0
Comparing and implementing calculi of explicit substitutions with eta-reduction
Elementary arithmetic
Groups elementarily equivalent to metabelian Baumslag - Solitar groups and regular bi-interpretability
Apartness spaces and uniform neighbourhood structures
Classifying Toposes for First-Order Theories
Extended Bar Induction in Applicative Theories
Locally Finite Weakly Minimal Theories
Quasiminimal structures, groups and Zariski-like geometries
Bounded forcing axioms and the continuum
Lower bound results on lengths of second-order formulas
A lower bound for intuitionistic logic
Some characterization and preservation theorems in modal logic
Realizability for Peano arithmetic with winning conditions in HON games
A transfer theorem in constructive real algebra
Zilber's Conjecture for Some o-Minimal Structures over the Reals
Essentially periodic ordered groups
Monadic second-order properties of very sparse random graphs
Finite information logic
Classification of Degree Classes Associated with r.e. Subspaces
Some Intuitions Behind Realizability Semantics for Constructive Logic: Tableaux and Läuchli Countermodels
The theory of ceers computes true arithmetic
The limits of E-recursive enumerability
Varieties of quasi-Stone algebras
The Kierstead's Conjecture and limitwise monotonic functions
The Notion of Independence in Categories of Algebraic Structures, Part III: Equational Classes
Bounded fixed-parameter tractability and reducibility
Changing cofinalities and collapsing cardinals in models of set theory
Independence results in formal topology
Semantics of higher-order quantum computation via geometry of interaction
Covering theorems for the core model, and an application to stationary set reflection
Equivalents of the finitary non-deterministic inductive definitions
Non-primitive recursive decidability of products of modal logics with expanding domains
The logic of tasks
A Classical View of the Intuitionistic Continuum
Ordinal analysis by transformations
Generality's price: Inescapable deficiencies in machine-learned programs
The spectrum of elementary embeddings j: V->V
On reflection principles
Random generations of the countable random graph
Game-based notions of locality over finite models
Saturated models of intuitionistic theories
More on Cardinal Invariants of Boolean Algebras
Introducing article numbering to Annals of Pure and Applied Logic
Aspects of predicative algebraic set theory I: Exact completion
Vaught's conjecture for superstable theories of finite rank
More on the Cut and Choose Game
A unification algorithm for second-order monadic terms
The bounded functional interpretation of bar induction
On a common generalization of Shelah's 2-rank, dp-rank, and o-minimal dimension
Permitting, Forcing, and Copying of a Given Recursive Relation
Degrees which do not bound minimal degrees
A generalization of von Neumann regularity
Classification Theory through Stationary Logic
On the consistency strength of the Milner-Sauer conjecture
Forcing in Nonstandard Analysis
Martin's Maximum and definability in H(xaleph 2 )
Model-completions for Abelian lattice-ordered groups with finitely many disjoint elements
Final coalgebras and the Hennessy-Milner property
Coding a Family of Sets
The syntax of nonstandard analysis
A parametrised functional interpretation of Heyting arithmetic
Finite methods in 1-order formalisms
Interpretation of De Finetti coherence criterion in Lukasiewicz Logic
Superstable groups
Algorithms for Sentences over Integral Domains
A Note on the Diagonalizable Algebras of PA and ZF
Dual weak pigeonhole principle, Boolean complexity, and derandomization
Two subcategories of apartness spaces
Changing cardinal characteristics without changing Omega-sequences or cofinalities
Computability of the ergodic decomposition
Structures algébriques dynamiques, espaces topologiques sans points et programme de Hilbert
Abstract State Machines: a unifying view of models of computation and of system design frameworks
Chu Spaces from the Representational Viewpoint
Join-completions of partially ordered algebras
Computable fields and the bounded Turing reduction
Existential arithmetization of Diophantine equations
A globalisation of the Gelfand duality theorem
Nonaxiomatisability of Equivalences over Finite State Processes
In the Random Graph G(n, p), p = n -a : If psi Has Probability O(n -epsilon ) for Every epsilon>0 Then it Has Probability O(e -n epsilon ) for Some epsilon>0
Some Highly Undecidable Lattices
Guessing more sets
Proof-theoretic conservations of weak weak intuitionistic constructive set theories
Window-accumulated subsequence matching problem is linear
Elementary differences between the degrees of unsolvability and degrees of compressibility
A Simpler proof of Jensen's Coding Theorem
The spectrum of independence, II
What languages have Tarski truth definitions?
Blowing up the power of a singular cardinal of uncountable cofinality with collapses
Axiomatizing the monodic fragment of first-order temporal logic
The tree property at double successors of singular cardinals of uncountable cofinality with infinite gaps
Reflecting pictures in cardinal arithmetic
Probabilistic characterisation of models of first-order theories
Typical forcings, NP search problems and an extension of a theorem of Riis
Halfway new cardinal characteristics
The computable Lipschitz degrees of computably enumerable sets are not dense
Turing Centenary Conference: How the World Computes
On the number of independent orders
Completeness for μ -calculi: A coalgebraic approach
The complexity of random ordered structures
Exact approximations to Stone-Cech compactification
On monadic MV -algebras
Determinacy of refinements to the difference hierarchy of co-analytic sets
Characterizations of the weakly compact ideal on P κ λ
Around provability logic
Reasoning about sequences of memory states
Reverse mathematics and initial intervals
Ideas in the epsilon substitution method for II 1 0 -FIX
Large cardinals and definable well-orders, without the GCH
Comparing Cubes of Typed and Type Assignment Systems
Parameter-free polymorphic types
Rings of Monoids Elementarily Equivalent to Polynomial Rings
Inductive types and exact completion
Axiomatizing Higher-Order Kleene Realizability
Realism, nonstandard set theory, and large cardinals
Some descriptive set theory and core models
The eskolemization of universal quantifiers
Computation on Abstract Data Types: The Extensional Approach, with an Application to Streams
Logical structures and genus of proofs
A Decision Algorithm for Linear Sentences on a PFM
Automated search for Gödel's proofs
A New Strongly Minimal Set
Categoricity results for L ∞κ
Ramified Recurrence and Computational Complexity III: Higher Type Recurrence and Elementary Complexity
Abstract complexity theory and the Delta 2 0 degrees
Generating transformation semigroups using endomorphisms of preorders, graphs, and tolerances
Maharam algebras
Equivalence of bar induction and bar recursion for continuous functions with continuous moduli
Determinacy and Extended Sharp Functions on the Reals, Part II: Obtaining Sharps from Determinacy
Normalization without reducibility
Finite approximation of measure and integration
Sequent Reconstruction in LLM - A Sweepline Proof
An Alternative Linear Semantics for Allowed Logic Programs
A Slow Growing Analogue to Buchholz' Proof
Universal proof theory: Feasible admissibility in intuitionistic modal logics
The least strongly compact can be the least strong and indestructible
Learning based realizability for HA + EM1 and 1-Backtracking games: Soundness and completeness
Towards the decidability of the theory of modules over finite commutative rings
Computably categorical Boolean algebras enriched by ideals and atoms
Meager Forking
Cardinality logics, part I: inclusions between languages based on 'exactly'
Recursive analysis of singular ordinary differential equations
Σ 0 1 and Π 0 1 equivalence structures
Computable categoricity and the Ershov hierarchy
Borel Ideals vs. Borel Sets of Countable Relations and Trees
Hod up to ADR+Θ is measurable
Abelian C-minimal groups
Adequate predimension inequalities in differential fields
Inductive theorem proving based on tree grammars
Relation Algebras with n-Dimensional Relational Bases
Relating the Bounded Arithmetic and Polynomial Time Hierarchies
chi 0 - categorical structures with a predimension
A characterization of those categories whose internal logic is Hilbert's ε -calculus
A non-splitting theorem in the enumeration degrees
Lipschitz and Wadge binary games in second order arithmetic
Differential Galois Theory II
Classical Logic, Storage Operators and Second-Order lambda-Calculus
Succinctness as a Source of Complexity in Logical Formalisms
Continuation-passing style models complete for intuitionistic logic
The Nikodym property and cardinal characteristics of the continuum
Model Theory of Finite Fields and Pseudo-Finite Fields
Second-order type isomorphisms through game semantics
Constructive characterizations of bar subsets
Natural non-dcpo domains and f-spaces
The semi-weak square principle
Choice and independence of premise rules in intuitionistic set theory
aleph 0 -Categorical, aleph 0 -stable structures
Equiconsistency of the Minimalist Foundation with its classical version
Model Completeness Results for Elliptic and Abelian Functions
On n-tardy sets
Two chain conditions and their Todorčević's fragments of Martin's Axiom
Unbounded towers and products
Models of real-valued measurability
On self-embeddings of computable linear orderings
Diagonal supercompact Radin forcing
Inaccessible set axions may have little consistency strength
Randomness and the linear degrees of computability
On Gödel incompleteness and finite combinatorics
Modality, Bisimulation and Interpolation in Infinitary Logic
Stochastic coalgebraic logic: Bisimilarity and behavioral equivalence
Cell decomposition and dimension function in the theory of closed ordered differential fields
Bilattice logic of epistemic actions and knowledge
Demuth randomness and computational complexity
2-Sequent Calculus: A Proof Theory of Modalities
Lattice Nonembeddings and Intervals of the Recursively Enumerable Degrees
Levy and set theory
Parametrization over Inductive Relations of a Bounded Number of Variables
Randomness, Computability, and Algebraic Specifications
The full basis theorem does not imply analytic wellordering
Conceptual Completeness for First-Order Intuitionistic Logic: An Application of Categorical Logic
The Monadic Second-Order Logic of Graphs VIII: Orientations
Approximations of modal logics: K and beyond
The Skolemization of existential quantifiers in intuitionistic logic
Constructive Ackermann's interpretation
Programming interfaces and basic topology
Quantifier elimination on some pseudo-algebraically closed valued fields
Universes in explicit mathematics
Multifunction algebras and the provability of PH
On transformations of constant depth propositional proofs
The complexity of predicate default logic over a countable domain
Intervals and Sublattices of the r.e. Weak Truth Table Degrees, Part I: Density
Coset-minimal groups
Preservation theorems for Namba forcing
About cut elimination for logics of common knowledge
A Banach-Mazur computable but not Markov computable function on the computable real numbers
Four and more
MA ( I ) and a failure of separation on the third level
Proof-theoretic investigation of λβ-reduction in the simply typed λ-calculus
Induced and higher-dimensional stable independence
When Is Arithmetic Possible?
On the unity of duality
Totality in arena games
External cofinalities and the antichain condition in partial orders
Strong Polynomial-Time Reducibility
A constructive consistency proof of a fragment of set theory
Descent and Duality
The Structure of Lattices of Subframe Logics
Abelian C-minimal valued groups
Set-theoretical models of λ-calculus: theories, expansions, isomorphisms
Generic pairs of SU-rank 1 structures
Order Types of Free Subsets
Totality in Applicative Theories
Dependence of variables construed as an atomic formula
Lattice Representations for Computability Theory
The notion of independence in categories of algebraic structures, part I: Basic properties
Forking, normalization and canonical bases
Provability logics with quantifiers on proofs
A Sahlqvist theorem for distributive modal logic
Condensational equivalence, equimorphism, elementary equivalence and similar similarities
Free abelian lattice-ordered groups
The Elementary Theory of e-free PAC Domains
Zero-dimensional σ -homogeneous spaces
Riesz Representation Theorem, Borel Measures and Subsystems of Second-Order Arithmetic
An infinite-game semantics for well-founded negation in logic programming
Recursive Unary Algebras and Trees
Axiomatizing first-order consequences in independence logic
Weakly Semirecursive Sets and r.e. Orderings
Substructures and uniform elimination for p-adic fields
Minimal Coding
Proof theory for admissible rules
Integration in algebraically closed valued fields with sections
The intuitionistic fragment of computability logic at the propositional level
Reexamination of Tarski's semantics
Henkin and Function Quantifiers
The number of translates of a closed nowhere dense set required to cover a Polish group
Ehrenfeucht-Fraïssé games on ordinals
A topological zero-one law and elementary equivalence of finitely generated groups
Model theory of adeles I
Minimal Collapsing Extensions of Models of ZFC
A proof-theoretic investigation of a logic of positions
Chains in Boolean algebras
Some coloring properties for uncountable cardinals
A comparison of well-known ordinal notation systems for epsilon 0
Minimal Degrees Recursive in 1-Generic Degrees
On countable locally described structures
Extraspecial p-groups
Decomposing Borel functions and structure at finite levels of the Baire hierarchy
Covers of Abelian varieties as analytic Zariski structures
First-order Gödel logics
Characterizing the interpretation of set theory in Martin-Löf typetheory
Full Intuitionistic Linear Logic (extended abstract)
A cut elimination theorem for stationary logic
Relating first-order set theories, toposes and categories of classes
Short extenders forcings - doing without preparations
Sticks and Clubs
On elementary properties of free lie algebras
Inherently nonfinitely based lattices
Note on witnessed Gödel logics with Delta
Rough concept lattices and domains
Preface - Papers in honor of the Symposium on Logical Foundations of Computer Science "Logic at St. Petersburg"
Sigma 1 -elementarity and Skolem hull operators
Games with finitely generated structures
From the weak to the strong existence property
Non-circular proofs and proof realization in modal logic
Some examples of precipitous ideals
Bounding, splitting, and almost disjointness
Boolean Powers of Abelian Groups
Constructive completions of ordered sets, groups and fields
Relative categoricity in abelian groups II
Fundamental results for pointfree convex geometry
A Dichotomy Theorem for Regular Types
Borel reducibility and finitely Hölder(α) embeddability
Topological forcing semantics with settling
Global singularization and the failure of SCH
Modal and guarded characterisation theorems over finite transition systems
Mouse Sets
Chain conditions in dependent groups
CE-cell decomposition and open cell property in o-minimal structures
Proof nets sequentialisation in multiplicative linear logic
The Density of Infima in the Recursively Enumerable Degrees
WKL 0 and Stone's Separation Theorem for Convex Sets
Independence in finitary abstract elementary classes
Bootstrapping, part I
Operations, climbability and the proper forcing axiom
Randomness for computable measures and initial segment complexity
Increasing the groupwise density number by c.c.c. forcing
Simple generic structures
First-Order Definability on Finite Structures
Indifference to symmetry in Hrushovski's ab initio construction
Back-and-forth systems for generic curves and a decision algorithm for the limit theory
Recognizable sets and Woodin cardinals: computation beyond the constructible universe
Authentication schemes from actions on graphs, groups, or rings
A constructive version of Tarski's geometry
Bounded Arithmetic for NC, ALogTIME, L and NL
Inner Models with Many Woodin Cardinals
The existence of high nonbounding degrees in the difference hierarchy
On Restricted Forms of Enumeration Reducibility
The Manin-Mumford conjecture and the model theory of difference fields
Z-modules and ful completeness of multiplicative linear logic
The covering lemma for L[U]
Club-guessing, stationary reflection, and coloring theorems
Profinite structures interpretable in fields
Reverse mathematics and Peano categoricity
Automorphism groups of differentially closed fields
General Iteration and Unary Functions
Simplified Gap-2 morasses
Projective wellorders and mad families with large continuum
An example of an automatic graph of intermediate growth
Corrigendum: Correction to "Undecidability of L(F infty ) and Other Lattices of r.e. Substructures"
The Consistency Strength of Projective Absoluteness
Subgroups of the additive group of a separably closed field
An Aristotelian notion of size
A cut-free sequent system for two-dimensional modal logic, and why it matters
Axiomatizations of team logics
Things That Can and Things That Cannot Be Done in PRA
On pp-elimination and stability in a continuous setting
On Farkas' lemma and related propositions in BISH
An Analogy Principle in Inductive Logic
Mints Type Deductive Calculi for Logic Programming
Equational definitions of logical filters
On the reflection invariance of residuated chains
The Machinery of Consistency Proofs
In the full propositional logic, 5/8 of classical tautologies are intuitionistically valid
Quadratic forms in models of IDelta 0 +Omega 1 . I
More on HOD-supercompactness
Game semantics for non-monotonic intensional logic programming
The high/low hierarchy in the local structure of the omega-enumeration degrees
Elementary inductive dichotomy: Separation of open and clopen determinacies with infinite alternatives
Positive results in abstract model theory: a theory of compact logics
An exposition of Hrushovski's New Strongly Minimal Set
Lattice Nonembeddings and Initial Segments of the Recursively Enumerable Degrees
Weighted o-minimal hybrid systems
A nonasymptotic lower time bound for a strictly bounded second-order arithmetic
Typing in reflective combinatory logic
Combinatorial Principles in Elementary Number Theory
Kunen the expositor
Cardinal Invariants Above the Continuum
Generalizing Theorems in Real Closed Fields
Foreword for special issue of APAL for GaLoP 2005
On nonelementarily equivalent pairs of fields
Characterizing large cardinals in terms of layered posets
The tree property at first and double successors of singular cardinals with an arbitrary gap
The metamathematics of ergodic theory
Combinatorics and Forcing with Distributive Ideals
Erratum to "What's So Special About Kruskal's Theorem and the Ordinal Gamma 0 ? A Survey of Some Results in Proof Theory"
The covering lemma for K
Groups definable in Presburger arithmetic
Imperative programs as proofs via game semantics
Reverse Mathematics and Ordinal Exponentiation
On sparseness, reducibilities, and complexity
The Analytical Completeness of Dzhaparidze's Polymodal Logics
Intuitionistic logic and implicit definability
Automata and logics over finitely varying functions
Superstable groups; a partial answer to conjectures of Cherlin and Zil'ber
Narrow Coverings of omega-ary Product Spaces
Metric spaces are universal for bi-interpretation with metric structures
Stephen Cole Kleene - a Reminiscence
Menas' conjecture and generic ultrapowers
The descriptive set-theoretical complexity of the embeddability relation on models of large size
Algorithms and complexity in biological pattern formation problems
A Normal Form for Logical Derivations Implying One for Arithmetic Derivations
A quantified logic of evidence
Symmetry and the union of saturated models in superstable abstract elementary classes
Generalized fusible numbers and their ordinals
Stable domination and weight
A computational glimpse at the Leibniz and Frege hierarchies
An independence result for (II 1 1 -CA)+BI
An undecidability result for the asymptotic theory of p -adic fields
Applying, extending, and specializing pseudorecursiveness
Bounded Arithmetic and the Polynomial Hierarchy
Independence relations for exponential fields
A Contribution to the End-Extension Problem and the Pi 1 Conservativeness Problem
Admissibility spectra and minimality
'bottom' N as an abstract elementary class
First-order intensional logic
End extending models of set theory via power admissible covers
Compatibility between modal operators in distributive modal logic
Owings-like theorems for infinitely many colours or finite monochromatic sets
Computably Enumerable Sets and Quasi-Reducibility
Coherence in linear predicate logic
Arithmetic complexity of the predicate logics of certain complete arithmetic theories
Template iterations with non-definable ccc forcing notions
1-Generic splittings of computably enumerable degrees
Interpreting Modules in Modules
The complexity of temporal logic over the reals
On the Kolmogorov complexity of continuous real functions
Randomness and lowness notions via open covers
P-points and Q-points over a measurable cardinal
Strength and limitations of Sherali-Adams and Nullstellensatz proof systems
A-computable graphs
On uniform weak König's lemma
Approximation of o-minimal maps satisfying a Lipschitz condition
Is cut-free logic fit for unrestricted abstraction?
The theory DCF A exists for p > 0
Categoricity in multiuniversal classes
Self-referentiality of Brouwer-Heyting-Kolmogorov semantics