LC 2017: LOGIC COLLOQUIUM 2017

This page contains an index consisting of author-provided keywords.

0
0-dimensional Compact Hausdorff spaces	Stone duality and applications in computer science (1/3)
01A55	Frege's Begriffsschrift and logicism
03-03	Frege's Begriffsschrift and logicism
03A02	Negative Properties in First-Degree Entailment with Constructible Negation and an Extensional Semantics
03A05	Frege's Begriffsschrift and logicism
03A05+00A30	G\"odel's second incompleteness theorem cannot be used as an argument against Hilbert's program
03A99	When Curry met Abel Volutionary deliberations
03Axx	Monotonic functions are logically four-valued On Hilbert’s Axiomatic Method
03B15	The Diller-Nahm model of type theory
03B25	On the Decidability of Mereological Theories with Local Complementation
03B30	Remarks on satisfaction classes and recursive saturation Some new bounds on the strength of restricted versions of Hindman's Theorem Some Weak Yet Strong restrictions of Hindman's Theorem
03B42	On completeness of epistemic theories
03B45	A modal operator in multi-modal mu-calculus and induced semiring structure On completeness of epistemic theories Formula size games for modal logics Connectives as relative modalities
03B47	Belnap-Dunn semantics for natural implicative expansions of Kleene's strong three-valued matrix Routley-Meyer semantics for natural implicative expansions of Kleene's strong three-valued matrix
03B50	Application of Kalmar's proof of deducibility in two valued propositional logic for many valued logic. Monotonic functions are logically four-valued Propositional sequent systems of two valued classical logic and many valued logics are no monotonous.
03B50 – many-valued logic	Revealing the 4D vector space within disquotational truth theory for self-reference statements
03B70	How could a logician help solving the P =? NP problem? On completeness of epistemic theories
03B70: Logic in computer science	Propositional Dynamic Logic for Bisimilar programs with Parallel Operator and Test
03B99	Multirole Logic
03C07: Basic properties of first-order languages and structures	Definability between temporal relations in dynamic mereology
03C10	Easy and hard homogenizable structures
03C20	Keisler's order via Boolean ultrapowers
03C25	Boolean-valued models of ZFC and forcing in geometry and physics
03C345	NIP fields and henselianity
03C45	Constructing and classifying stability-preserving substructures Some VC-combinatorial aspects of definable set systems Keisler's order via Boolean ultrapowers
03C45 classification	Topology of isomorphism types of countable structures
03C50	Easy and hard homogenizable structures Constructing and classifying stability-preserving substructures
03C57 computable model theory	Topology of isomorphism types of countable structures
03C60	Constructing and classifying stability-preserving substructures
03C70	Determinacy of Boolean combinations of $\Sigma^0_3$ games
03c98	On Approximations and Eigenvectors - looking at Quantum Physics via Metric Ultraproducts
03D28	On the computability of perfect subsets of sets with positive measure
03D30	Structural properties of the cototal enumeration degrees
03D30 -Other degrees and reducibilities	On prefix realizability problems of infinite words for natural subsets of context-free languages
03D45	Rogers semilattices in analytical hierarchy
03D45 computable structure theory	Topology of isomorphism types of countable structures
03D60	On computability in hereditarily finite superstructures and computable analysis Determinacy of Boolean combinations of $\Sigma^0_3$ games
03D78 continuous computation	Topology of isomorphism types of countable structures
03Dxx-Computability and recursion theory	Limitwise monotonic reducibility between sequences of sets and Sigma-definability of abelian groups
03E02 Partition relations	Partition relations equiconsistent with $o(o(\ldots o(\kappa)\ldots)) = 2$
03E05	Keisler's order via Boolean ultrapowers
03E15	Open colorings on generalized Baire spaces
03E15 03E35	The full basis theorem does not imply analytic wellordering
03E15 effective descriptive set theory	Topology of isomorphism types of countable structures
03E35	Open colorings on generalized Baire spaces Algebraic new foundations
03E35 Consistency and independence results	Partition relations equiconsistent with $o(o(\ldots o(\kappa)\ldots)) = 2$
03E55 Large cardinals	Partition relations equiconsistent with $o(o(\ldots o(\kappa)\ldots)) = 2$
03E57	Happy and mad families
03E60	Determinacy of Boolean combinations of $\Sigma^0_3$ games
03E75	Set-theoretic pathologies in accessible categories
03F03	An invitation to proof mining: two applications in nonlinear operator theory When one must strengthen one's induction hypothesis Genus of proofs as a measure of complexity Investigating some effects of display property
03F07	Genus of proofs as a measure of complexity A Proof-Theoretic Semantics for Disjunction
03F10	A quantitative analysis of a theorem by F.E.Browder guided by the bounded functional interpretation An invitation to proof mining: two applications in nonlinear operator theory Proof mining in convex optimization
03F20	On proof complexities for some classes of tautologies in Frege systems
03F30	Remarks on satisfaction classes and recursive saturation Determinacy of Boolean combinations of $\Sigma^0_3$ games On local induction rules: collapse and conservation properties
03F30 First-order arithmetic and fragments	Reflection principles, bounded induction and axiomatic truth theories.
03F35	Some Weak Yet Strong restrictions of Hindman's Theorem
03F40	Gödel's second incompleteness theorem from scratch
03F45	Two theorems on provability logics
03F52	Non-decomposable connectives of Linear Logic
03Fxx	On Some Systems of Minimal Propositional Logic with History Mechanism
03G10: Lattices and related structures	Definability between temporal relations in dynamic mereology
03G20	Łukasiewicz logic, with coefficients
03G27: Abstract algebraic logic	Definability between temporal relations in dynamic mereology
03G30	Algebraic new foundations
03H05	Algebraic new foundations
03H15	Remarks on satisfaction classes and recursive saturation On local induction rules: collapse and conservation properties Nonstandard methods and construction of models of arithmetics
03xxx	Plural Categoricals and Squares of Opposition The Semanticist's Guide to Ramification Łukasiewicz logic, with coefficients Relation algebras, representability and relevant logics Ecumenism: a new perspective on the relation between logics. Truth as a Logical Property (Dynamic) epistemic interpretation for erotetic search scenarios Intuitionistic logic is not complete for standard proof-theoretic semantics Type Theory of Restricted Algorithms and Neural Networks The Diller-Nahm model of type theory A solution to Frege's puzzle in Homotopy Type Theory Genus of proofs as a measure of complexity Diagrammatic Reasoning for Boolean Equations Cut-free completeness for modal mu-calculus Interpolation for modal mu-calculus Some Weak Yet Strong restrictions of Hindman's Theorem Why Does Formal Deductive Logic Start With the Classical Greeks? Names in Topos Theory
05C63	Easy and hard homogenizable structures
05C75	Easy and hard homogenizable structures
05D10	Some Weak Yet Strong restrictions of Hindman's Theorem
06A15	Monotonic functions are logically four-valued
06D35	Łukasiewicz logic, with coefficients
1
18C35	Set-theoretic pathologies in accessible categories
2
2010 MSC: 03B30	Arithmetical transfinite Recursion and Relatives
2010 MSC: 03F03	Arithmetical transfinite Recursion and Relatives
2010 MSC: 03F35	Arithmetical transfinite Recursion and Relatives
4
47H10	A quantitative analysis of a theorem by F.E.Browder guided by the bounded functional interpretation
4D vector space	Revealing the 4D vector space within disquotational truth theory for self-reference statements
5
53Z05	Boolean-valued models of ZFC and forcing in geometry and physics
8
81P10	Boolean-valued models of ZFC and forcing in geometry and physics
83F05	Boolean-valued models of ZFC and forcing in geometry and physics
\
\Sigma^1_2 sets	Countable Borel chromatic numbers and Sigma^1_2 sets
A
A.N. Prior	The Rise of Temporal Logic
abelian group	Limitwise monotonic reducibility between sequences of sets and Sigma-definability of abelian groups
abstract model theory	Set-theoretic pathologies in accessible categories
accessible categories	Set-theoretic pathologies in accessible categories
accretive operator	An invitation to proof mining: two applications in nonlinear operator theory
Admissibility	On the Admissibility of the Structural Rules in Kanger's Calculus with Restricted Equality Rules
algebra of distributions for binary formulas	On algebras of distributions for binary formulas of quite o-minimal theories with non-maximum many countable models
Algebraic Model Theory	Constructing and classifying stability-preserving substructures
Algebraic set theory	Algebraic new foundations
Algebraic Stability Theory	Constructing and classifying stability-preserving substructures
algorithm	Type Theory of Restricted Algorithms and Neural Networks
Algorithm of iterated regret minimization (IERS)	A plausibility model for regret games
alternating-time temporal logic ATL	Compositional vs game-theoretic semantics for alternating-time temporal Logics
Alternative Resolution of the Paradoxes	Volutionary deliberations
Amenable groups	Non-amenablility of automorphism groups of generic structures
AMS 2010 classification: 03xxx	A polarized partition theorem for large saturated linear orders
AMS2010: 03B47 03F52	A normalizing system of natural deduction for relevant logic
Analytic Method	On Hilbert’s Axiomatic Method
analytical hierarchy	Rogers semilattices in analytical hierarchy
analytically definable wellordering	The full basis theorem does not imply analytic wellordering
Applications of computability theory	A computable solution to Partee's puzzle
Applications to Algebraic Geometry	A stroll through some important notions of model theory and their applications in geometry
approximate counting	Counting in weak theories
Argument	The Notion of Paradox
Aristotle	Why Does Formal Deductive Logic Start With the Classical Greeks?
arithmetic of infinity	How to make an infinite decision
Arithmetical interpretations	Two theorems on provability logics
Arithmetical Truth	Truth as a Logical Property
assertion	Assertion and request
associates/codes	A computable solution to Partee's puzzle
asymptotic analysis	Logical co-operation in multiplayer games
asymptotic density	Computability theory and asymptotic density
automata theory	Determinacy of Infinite Games: Perspectives of the Algorithmic Approach Normal Numbers, Logic and Automata
Automated Reasoning	A Decision Procedure Model for Finding the Missing Premise in Automated Reasoning
automated theorem proving	Benchmarking Linear Logic
automorphism	On the Kierstead's conjecture
Automorphism groups of countable structures	Non-amenablility of automorphism groups of generic structures
Avicenna	Avicenna sets up a modal logic with a Kripke semantics How far did Avicenna get with propositional logic?
Axiom	Two “Styles” of axiomatization: Rules versus Axioms. A Modern Perspective.
Axiomatic Method	On Hilbert’s Axiomatic Method
Axiomatic truth theories	Reflection principles, bounded induction and axiomatic truth theories.
B
Baire classes of functions	On decomposing Borel functions
Baire property	Infinite utility streams and irregular sets
Baire space	Determinacy of Infinite Games: Perspectives of the Algorithmic Approach
balanced formulas	On proof complexities for some classes of tautologies in Frege systems
Banach spaces	Families on large index sets and applications to Banach spaces
basis theorem	The full basis theorem does not imply analytic wellordering
Begriffsschrift	Frege's Begriffsschrift and logicism
Belnap-Dunn semantics	Belnap-Dunn semantics for natural implicative expansions of Kleene's strong three-valued matrix
better-binary-relation	Countable Borel chromatic numbers and Sigma^1_2 sets
bi-embeddable structures	Computable bi-embeddable categoricity of equivalence relations
bi-intuitionistic logic	Tomographs for Substructural Display Logic
Bisimulation	Propositional Dynamic Logic for Bisimilar programs with Parallel Operator and Test
Blakers-Massey theorem	On some categorical aspects of homotopy type theory
Boolean algebras	Stone duality and applications in computer science (1/3)
Boolean circuit complexity	Stone duality and applications in computer science (1/3)
Boolean ultrapowers	Keisler's order via Boolean ultrapowers
Borel chromatic number	Countable Borel chromatic numbers and Sigma^1_2 sets
Borel functions	On decomposing Borel functions
bound extraction	Proof mining in convex optimization
bounded arithmetic	Counting in weak theories
Bounded induction	Reflection principles, bounded induction and axiomatic truth theories.
Brentano	Brentano and Frege: The tunnel between analytic and continental theories of language with intentional inexistence and the judgement stroke.
Büchi's logic on words	Stone duality and applications in computer science (1/3)
C
Cardinal invariants	Definable Maximal Independent Families
cardinal invariants of the continuum	Negative partition relations from cardinal invariants
Caroll Diagrammatic Method	An Analysis of Peterson's Intermediate Syllogisms with Caroll's Diagrammatic Method
categorical	Plural Categoricals and Squares of Opposition
Categorical Amalgamation Theory	Constructing and classifying stability-preserving substructures
Categorical logic	The Diller-Nahm model of type theory Algebraic new foundations Models of set theory in path categories
categoricity	Some properties of central types for EPSCJ theories
category forcing axioms	Generic absoluteness for Chang models
Category theory	Topos Theory For Descriptive Modeling On some categorical aspects of homotopy type theory Names in Topos Theory
Chang models	Generic absoluteness for Chang models
Church Rule	Effectivity proprties of Intuitionistic Zermelo-Fraenkel Set Theory with DCS principle.
Circular proofs	Cut-free completeness for modal mu-calculus
class forcing	Maddian interpretations and their derived notions of restrictiveness
Classical logic	Ecumenism: a new perspective on the relation between logics.
classification	Systems of propositions referring to each other: a model-theoretic view
coarse computability	Computability theory and asymptotic density
cohomology of difference algebraic groups	Enriching our view of model theory of fields with operators
collapse	Systems of propositions referring to each other: a model-theoretic view
coloring number of graphs	Set-theoretic reflection of mathematical properties
combinatorial principles	On the first-order strength of Ramsey's theorem in reverse mathematics
combinatorics	Definability in the group of infinitesimal rotations
compact	Compactness of maximal eventually different families
Compactly expandable models	Universal theories and compactly expandable models
complementation	On the Decidability of Mereological Theories with Local Complementation
Completeness	An Analysis of Peterson's Intermediate Syllogisms with Caroll's Diagrammatic Method
completeness of formal system	Application of Kalmar's proof of deducibility in two valued propositional logic for many valued logic.
complexity of embeddings	Computable bi-embeddable categoricity of equivalence relations
complexity theory	On proof complexities for some classes of tautologies in Frege systems
composition	Transseries as surreal analytic functions
compositional semantics	Compositional vs game-theoretic semantics for alternating-time temporal Logics
computability	Reducibilities and Higman-like theorems in symbolic dynamics Normal Numbers, Logic and Automata
computability theory	On computability in hereditarily finite superstructures and computable analysis
computable analysis	On computability in hereditarily finite superstructures and computable analysis
computable bound extraction	An invitation to proof mining: two applications in nonlinear operator theory
computable categoricity	Computable bi-embeddable categoricity of equivalence relations
computable metric spaces	Characterizing the continuous degrees
computable numbering	Hyperimmunity and $A$--computable numberings
computable numberings	Rogers semilattices in analytical hierarchy
computable structure	Computable bi-embeddable categoricity of equivalence relations
computable structures	Computable quotient presentations of models of arithmetic and set theory
computably enumerable equivalence relation	Weakly precomplete dark computably enumerable equivalence relations
Computably enumerable preorders	A note on computably enumerable preorders
computational content of Nonstandard Analysis	Nonstandard Analysis, Computability Theory, and metastbility
concurrent game models	Compositional vs game-theoretic semantics for alternating-time temporal Logics
Conservation results	On local induction rules: collapse and conservation properties
Consistency formulae being consistency sentences	On the Provability of Consistency
consistency of arithmetic	Gödel's reading of Gentzen's first consistency proof for arithmetic
Consistency sentences	On the Provability of Consistency
consistency-wise separation	Inductive Dichotomy and Determinacy of Difference Hierarchya
constraints	Type Theory of Restricted Algorithms and Neural Networks
constructible hierarchy	Set-theoretic pathologies in accessible categories
constructible negation	Negative Properties in First-Degree Entailment with Constructible Negation and an Extensional Semantics
Constructive set theory	Models of set theory in path categories
continuous degrees	Characterizing the continuous degrees
continuous logic	Model theory of strongly ergodic actions
CONTRADICTION	Meanings of contradicts.
Converse to Tarski	Refuting 'Converse to Tarski' Conjecture
convex optimization	Proof mining in convex optimization
convexity rank	On preserving properties under expanding models of quite o-minimal theories
cototal enumeration degrees	Structural properties of the cototal enumeration degrees
countable categoricity	On preserving properties under expanding models of quite o-minimal theories
countable model	On algebras of distributions for binary formulas of quite o-minimal theories with non-maximum many countable models
counterfactuals	Reasoning with counterfactual scenarios: from models to proofs
Craig interpolation	Interpolation for modal mu-calculus
Curry Paradox	The Notion of Paradox
Curry's paradox	When Curry met Abel
cut-elimination	Multirole Logic
Cut-free completeness	Cut-free completeness for modal mu-calculus
D
dark c.e.preorders	A note on computably enumerable preorders
dark ceers	Weakly precomplete dark computably enumerable equivalence relations
database theory	Schema mappings: structural properties and limits
David Hilbert	On Hilbert’s Axiomatic Method
DC	Generic absoluteness for Chang models
decidability	On the Decidability of Mereological Theories with Local Complementation
Decision Procedures	A Decision Procedure Model for Finding the Missing Premise in Automated Reasoning
decomposable	On decomposing Borel functions
definability	Characterizing the continuous degrees
definable compactness	Definable connectedness and definable compactness in the weakly o-minimal context
definable connectedness	Definable connectedness and definable compactness in the weakly o-minimal context
Definition by recursion	On extending the general recursion theorem to non-wellfounded relations
degrees of categoricity	Computable bi-embeddable categoricity of equivalence relations
democracy	Why Does Formal Deductive Logic Start With the Classical Greeks?
Dependent type theory	Sheaf models of type theory The Diller-Nahm model of type theory Models, Interpretations and the Initiallity Conjectures. Polynomials and theories
descriptive complexity	How could a logician help solving the P =? NP problem?
Descriptive Modeling	Topos Theory For Descriptive Modeling
descriptive set theory	Definable Maximal Independent Families Strongly surjective linear orders Normal Numbers, Logic and Automata
determinacy	Happy and mad families Inductive Dichotomy and Determinacy of Difference Hierarchya
Diagrammatic Reasoning	Diagrammatic Reasoning for Boolean Equations
Difference field	Enriching our view of model theory of fields with operators
different	Compactness of maximal eventually different families
differential field	Enriching our view of model theory of fields with operators
disjunction property	Effectivity proprties of Intuitionistic Zermelo-Fraenkel Set Theory with DCS principle.
display calculus	Investigating some effects of display property
display logic	Tomographs for Substructural Display Logic
disquotational truth	Revealing the 4D vector space within disquotational truth theory for self-reference statements
distal systems	Model theory of strongly ergodic actions
distributed programming	Multirole Logic
distribution for countable models	On distributions for countable models of quite o-minimal theories with non-maximum many countable models
Double Complement of Sets Principle	Effectivity proprties of Intuitionistic Zermelo-Fraenkel Set Theory with DCS principle.
dual mathematics	Dathematics: a meta-isomorphic version of classic mathematics based on proper classes
duality	Stone duality for infinitary first-order logic
Duality for additional structure	Stone duality and applications in computer science (1/3)
duty	Assertion and request
dynamic epistemic logic	Dynamic Belief Logic Based on Evidential Observation
dynamical systems	Caristi's fixed point theorem and strong systems of arithmetic
E
Ecumenical codificato	Ecumenism: a new perspective on the relation between logics.
Ecumenical system	Gentzen's justification of inferences and the ecumenical systems
Effective Hausdorff Dimension	Irrationality Exponents and Effective Hausdorff Dimension
effectively	Compactness of maximal eventually different families
Ehrenfeucht theory	A note on small stable theories
Enriched categories	Polynomials and theories
enriched category	Enriching our view of model theory of fields with operators
enumeration degrees	Structural properties of the cototal enumeration degrees Applications of computability theory in topology
epimorphism	Strongly surjective linear orders
epistemic logic	(Dynamic) epistemic interpretation for erotetic search scenarios
Epistemic social networks	The Logical basis of a formal epistemology for social networks
Equality	A solution to Frege's puzzle in Homotopy Type Theory On the Admissibility of the Structural Rules in Kanger's Calculus with Restricted Equality Rules
equivalence structure	Computable bi-embeddable categoricity of equivalence relations
erotetic logic	(Dynamic) epistemic interpretation for erotetic search scenarios
Euclid	Euclidean Geometry in Renaissance
evasion number	Negative partition relations from cardinal invariants
eventually	Compactness of maximal eventually different families
evidential reasoning	Dynamic Belief Logic Based on Evidential Observation
Existence of positive consistency sentences?	On the Provability of Consistency
EXISTENTIAL IMPORT	Teaching universalized-conditionals and Hazen’s Theorem.
EXISTENTIALIZED-CONJUNCTION	Teaching universalized-conditionals and Hazen’s Theorem.
existentially closed model	Some properties of central types for EPSCJ theories
existentially prime theory	Some properties of central types for EPSCJ theories
expansion of a model	On preserving properties under expanding models of quite o-minimal theories
Explicit Mathematics	The extended predicative Mahlo Universe in Explicit Mathematics - model construction
expressibility	Defining modal logics of relations between models
EXPTIME-completeness	Propositional Dynamic Logic for Bisimilar programs with Parallel Operator and Test
extended predicative	The extended predicative Mahlo Universe in Explicit Mathematics - model construction
extensional four-valued semantics	Negative Properties in First-Degree Entailment with Constructible Negation and an Extensional Semantics
extremal combinatorics	Some VC-combinatorial aspects of definable set systems
F
family	Compactness of maximal eventually different families
fan functionals	Nonstandard Analysis, Computability Theory, and metastbility
Feynman propagator	On Approximations and Eigenvectors - looking at Quantum Physics via Metric Ultraproducts
finitary proof	G\"odel's second incompleteness theorem cannot be used as an argument against Hilbert's program
finite automata	Generalized Finite Automata over the Real Numbers
finite-automata reducibility	On prefix realizability problems of infinite words for natural subsets of context-free languages
first degree entailment	Negative Properties in First-Degree Entailment with Constructible Negation and an Extensional Semantics
first order logic	Logical co-operation in multiplayer games
First-order classical logic	A herbrandized functional interpretation of classical first-order logic
first-order part	On the first-order strength of Ramsey's theorem in reverse mathematics
first-order theory	Systems of propositions referring to each other: a model-theoretic view
fixed point axioms	On some fixed point statements over Kripke Platek
fixed point theorems	Caristi's fixed point theorem and strong systems of arithmetic
fixed point theory	A modal operator in multi-modal mu-calculus and induced semiring structure
fixed points	An invitation to proof mining: two applications in nonlinear operator theory
Fixpoint theorems	On extending the general recursion theorem to non-wellfounded relations
FOL(LFPO)	How could a logician help solving the P =? NP problem?
forcing	Adding a non-reflecting weakly compact set The tree property at the double successor of a singular cardinal The tree property at $\aleph_{\omega+2}$ with a finite gap A polarized partition theorem for large saturated linear orders Infinite utility streams and irregular sets Transversal of full outer measure
Formal epistemology	The Logical basis of a formal epistemology for social networks
formal logic	Intuitionistic tense logic. Some remarks.
formal semantics	Uniform Substitution and Replacement of Equivalents A computable solution to Partee's puzzle
Formalized arithmetic	Two theorems on provability logics
formalized recursive realizability	Effectivity proprties of Intuitionistic Zermelo-Fraenkel Set Theory with DCS principle.
formula size game	Formula size games for modal logics
fragment	Some properties of central types for EPSCJ theories
Fragments of arithmetic	On local induction rules: collapse and conservation properties
Frege	Brentano and Frege: The tunnel between analytic and continental theories of language with intentional inexistence and the judgement stroke.
Frege systems	On proof complexities for some classes of tautologies in Frege systems
Frege's puzzle	A solution to Frege's puzzle in Homotopy Type Theory
Friedberg numbering	Hyperimmunity and $A$--computable numberings
Fréchet-Urysohn property	On pcf spaces which are not Fréchet-Urysohn
Functional analysis	Describing limits of bounded sequences of measurable functions via nonstandard analysis.
Functional interpretation	A quantitative analysis of a theorem by F.E.Browder guided by the bounded functional interpretation
Functional interpretations	A herbrandized functional interpretation of classical first-order logic
G
G\"odel's second incompleteness theorem	G\"odel's second incompleteness theorem cannot be used as an argument against Hilbert's program
Game theory	Logical co-operation in multiplayer games
game-theoretic semantics	Compositional vs game-theoretic semantics for alternating-time temporal Logics
general frame	Defining modal logics of relations between models
generalized Baire spaces	Open colorings on generalized Baire spaces
generalized connectives	Non-decomposable connectives of Linear Logic
Generalized negation	When Curry met Abel
generic absoluteness	Generic absoluteness for Chang models
generic computability	Computability theory and asymptotic density
generic structure	A note on small stable theories
Generic structures	Non-amenablility of automorphism groups of generic structures
Gentzen	Gentzen's justification of inferences and the ecumenical systems Gödel's reading of Gentzen's first consistency proof for arithmetic
geography	Why Does Formal Deductive Logic Start With the Classical Greeks?
Goedel's 2nd Incompleteness Theorem	On the Provability of Consistency
Goodwillie calculus	On some categorical aspects of homotopy type theory
Gottlob Frege	Frege's Begriffsschrift and logicism
graded structures	Nonstandard methods and construction of models of arithmetics
Graph of a Borel function	Countable Borel chromatic numbers and Sigma^1_2 sets
Greece	Why Does Formal Deductive Logic Start With the Classical Greeks?
grossone	How to make an infinite decision
Group knowledge	The Logical basis of a formal epistemology for social networks
Gödel	Gödel's reading of Gentzen's first consistency proof for arithmetic
Gödel numbering	Gödel's second incompleteness theorem from scratch
H
Hardy fields	Surreal differential calculus
Harrington's theorem on arithmetical singletons	Refuting 'Converse to Tarski' Conjecture
Hausdorff Dimension	Irrationality Exponents and Effective Hausdorff Dimension
HAZEN'S THEOREM	Teaching universalized-conditionals and Hazen’s Theorem.
henselianity	NIP fields and henselianity
Herbrand's theorem	A herbrandized functional interpretation of classical first-order logic
hereditarily finite superstructure	On computability in hereditarily finite superstructures and computable analysis
Heyting algebra	A modal operator in multi-modal mu-calculus and induced semiring structure
Higher-order Computability Theory	Nonstandard Analysis, Computability Theory, and metastbility
hilbert axiomatization	Negative Properties in First-Degree Entailment with Constructible Negation and an Extensional Semantics
Hilbert's program	G\"odel's second incompleteness theorem cannot be used as an argument against Hilbert's program
Hilbert-style axiomatic system	Application of Kalmar's proof of deducibility in two valued propositional logic for many valued logic.
Hindman's Theorem	Some new bounds on the strength of restricted versions of Hindman's Theorem Some Weak Yet Strong restrictions of Hindman's Theorem
history	Why Does Formal Deductive Logic Start With the Classical Greeks? On Some Systems of Minimal Propositional Logic with History Mechanism
history of logic	Avicenna sets up a modal logic with a Kripke semantics How far did Avicenna get with propositional logic?
History of temporal logic	The Rise of Temporal Logic
HOD	The hereditarily ordinal definable sets in inner models with finitely many Woodin cardinals
Homogeneous Model Theory	Constructing and classifying stability-preserving substructures
Homotopy theory	On some categorical aspects of homotopy type theory
Homotopy type theory	A solution to Frege's puzzle in Homotopy Type Theory On some categorical aspects of homotopy type theory Models of set theory in path categories
Husserl	Brentano and Frege: The tunnel between analytic and continental theories of language with intentional inexistence and the judgement stroke.
hypercomplex numbers	Revealing the 4D vector space within disquotational truth theory for self-reference statements
hyperimmune set	Hyperimmunity and $A$--computable numberings
I
ideal	Adding a non-reflecting weakly compact set
IMPLICATION	Meanings of contradicts.
inaccessible cardinal	Open colorings on generalized Baire spaces
Incomplete Arguments	A Decision Procedure Model for Finding the Missing Premise in Automated Reasoning
independence results	Definable Maximal Independent Families On generalized Goodstein sequences
induction	When one must strengthen one's induction hypothesis
inductive definition	Inductive Dichotomy and Determinacy of Difference Hierarchya
inference rules	Models, Interpretations and the Initiallity Conjectures.
Inferences	Gentzen's justification of inferences and the ecumenical systems
inferentialism	Logical dynamism as a way of understanding plurality of logics
Infinitary Logic	Truth as a Logical Property Stone duality for infinitary first-order logic
infinite decision	How to make an infinite decision
infinite games	Determinacy of Infinite Games: Perspectives of the Algorithmic Approach
infinite word	On prefix realizability problems of infinite words for natural subsets of context-free languages
infinte structures	Generalized Finite Automata over the Real Numbers
initiallity conjecture	Models, Interpretations and the Initiallity Conjectures.
inner model theory	The hereditarily ordinal definable sets in inner models with finitely many Woodin cardinals
intensional object	Meanings of statement, proposition, and sentence.
intentional inexistence	Brentano and Frege: The tunnel between analytic and continental theories of language with intentional inexistence and the judgement stroke.
intentionality	Brentano and Frege: The tunnel between analytic and continental theories of language with intentional inexistence and the judgement stroke.
interpretations	Maddian interpretations and their derived notions of restrictiveness
intuitionistic logic	Ecumenism: a new perspective on the relation between logics. Intuitionistic logic is not complete for standard proof-theoretic semantics Intuitionistic tense logic. Some remarks. Investigating some effects of display property
Intuitionistic Zermelo-Fraenkel theory	Effectivity proprties of Intuitionistic Zermelo-Fraenkel Set Theory with DCS principle.
Irrationality Exponent	Irrationality Exponents and Effective Hausdorff Dimension
J
Jonsson set	Some properties of central types for EPSCJ theories
Jonsson theory	Some properties of central types for EPSCJ theories
Judgement stroke	Brentano and Frege: The tunnel between analytic and continental theories of language with intentional inexistence and the judgement stroke.
justification logic	Dynamic Belief Logic Based on Evidential Observation
K
Keisler's order	Keisler's order via Boolean ultrapowers
Kierstead's conjecture	On the Kierstead's conjecture
Kleene's strong three-valued logic	Routley-Meyer semantics for natural implicative expansions of Kleene's strong three-valued matrix
Kleene's strong three-valued matrix	Belnap-Dunn semantics for natural implicative expansions of Kleene's strong three-valued matrix
Kleene-Kreisel model	A computable solution to Partee's puzzle
Knowledge Representation	Two “Styles” of axiomatization: Rules versus Axioms. A Modern Perspective.
Krikpe-Platek set theory	The extended predicative Mahlo Universe in Explicit Mathematics - model construction
Kripke models	Intuitionistic tense logic. Some remarks.
Kripke-Platek set theory	On some fixed point statements over Kripke Platek
L
labelled sequent calculus	Reasoning with counterfactual scenarios: from models to proofs
Lachlan's Theorem	Remarks on satisfaction classes and recursive saturation
large cardinal	A polarized partition theorem for large saturated linear orders
large cardinals	Set-theoretic pathologies in accessible categories Adding a non-reflecting weakly compact set The tree property at the double successor of a singular cardinal The tree property at $\aleph_{\omega+2}$ with a finite gap The hereditarily ordinal definable sets in inner models with finitely many Woodin cardinals
Lawvere-Tierney topologies	Connectives as relative modalities
Lebesgue measurable	Infinite utility streams and irregular sets
library of problems	Benchmarking Linear Logic
limitwise monotonic function	On the Kierstead's conjecture Limitwise monotonic reducibility between sequences of sets and Sigma-definability of abelian groups
limitwise monotonic reducibility	Limitwise monotonic reducibility between sequences of sets and Sigma-definability of abelian groups
limitwise monotonic set	Limitwise monotonic reducibility between sequences of sets and Sigma-definability of abelian groups
linear logic	Benchmarking Linear Logic
linear order	On the Kierstead's conjecture
linear orders	Strongly surjective linear orders
Loeb's Theorem	On the Provability of Consistency
logic	Why Does Formal Deductive Logic Start With the Classical Greeks? Reasoning abhorrently
logic in computer science	Schema mappings: structural properties and limits
Logic of countable cofinality	Universal theories and compactly expandable models
Logical Connectives	Connectives as relative modalities
logical dynamism	Logical dynamism as a way of understanding plurality of logics
Logicality	Truth as a Logical Property
Logicism	Frege's Begriffsschrift and logicism
Logico-linguistic	Truth as a Logical Property
Logics for social networks	The Logical basis of a formal epistemology for social networks
looping	On Some Systems of Minimal Propositional Logic with History Mechanism
lower semi-continuous functions	Caristi's fixed point theorem and strong systems of arithmetic
M
mad family	Happy and mad families
Maddy	Maddian interpretations and their derived notions of restrictiveness
Mahlo Cardinal	Families on large index sets and applications to Banach spaces
Mahlo universe	The extended predicative Mahlo Universe in Explicit Mathematics - model construction
many valued logic	Propositional sequent systems of two valued classical logic and many valued logics are no monotonous.
many-valued logic	Application of Kalmar's proof of deducibility in two valued propositional logic for many valued logic.
Markov Rule	Effectivity proprties of Intuitionistic Zermelo-Fraenkel Set Theory with DCS principle.
Martin-Löf type theory	The extended predicative Mahlo Universe in Explicit Mathematics - model construction
Mathematical Logic	A stroll through some important notions of model theory and their applications in geometry
maximal	Compactness of maximal eventually different families
Maximal independent families	Definable Maximal Independent Families
Mealy automaton	On prefix realizability problems of infinite words for natural subsets of context-free languages
Medvedev degrees	Applications of computability theory in topology
mereology	On the Decidability of Mereological Theories with Local Complementation
metastability	Nonstandard Analysis, Computability Theory, and metastbility
Metatheoretical Inquiry	On Hilbert’s Axiomatic Method
metric ultraproduct	On Approximations and Eigenvectors - looking at Quantum Physics via Metric Ultraproducts
minimal logic	On Some Systems of Minimal Propositional Logic with History Mechanism
minimal sequent	Propositional sequent systems of two valued classical logic and many valued logics are no monotonous.
Missing Premise	A Decision Procedure Model for Finding the Missing Premise in Automated Reasoning
modal logic	Defining modal logics of relations between models Formula size games for modal logics Propositional Dynamic Logic for Bisimilar programs with Parallel Operator and Test
Modal mu-calculus	Formula size games for modal logics Cut-free completeness for modal mu-calculus Interpolation for modal mu-calculus
model	Systems of propositions referring to each other: a model-theoretic view
model theory	Are points (necessarily) unextended? A stroll through some important notions of model theory and their applications in geometry Defining modal logics of relations between models Recent directions in model theory Definability in the group of infinitesimal rotations NIP fields and henselianity
Model-checking	On the verification of timed systems – and beyond (1/3)
models of arithmetic	Computable quotient presentations of models of arithmetic and set theory
models of arithmetics	Nonstandard methods and construction of models of arithmetics
models of geometry	Are points (necessarily) unextended?
Models of Peano Arithmetic	Remarks on satisfaction classes and recursive saturation
Models of truth theories	Remarks on satisfaction classes and recursive saturation
modus ponens and modus tollens as valid rules	Negative Properties in First-Degree Entailment with Constructible Negation and an Extensional Semantics
monism	Logical dynamism as a way of understanding plurality of logics
monotonous sequent system	Propositional sequent systems of two valued classical logic and many valued logics are no monotonous.
Montague grammar	EXPRESSING NATURAL LANGUAGE SEMANTICS IN PROLOG A computable solution to Partee's puzzle
mu-calculus	A plausibility model for regret games
multirole	Multirole Logic
MV-algebras	Łukasiewicz logic, with coefficients
N
Natural deduction	Euclidean Geometry in Renaissance Uniform Substitution and Replacement of Equivalents A normalizing system of natural deduction for relevant logic
negative properties	Negative Properties in First-Degree Entailment with Constructible Negation and an Extensional Semantics
neighbourhood semantics	Reasoning with counterfactual scenarios: from models to proofs
neural-networks	Type Theory of Restricted Algorithms and Neural Networks
New foundations	Algebraic new foundations
NF	Algebraic new foundations
NFU	Algebraic new foundations
NIP	Some VC-combinatorial aspects of definable set systems NIP fields and henselianity
NLP	EXPRESSING NATURAL LANGUAGE SEMANTICS IN PROLOG
nominal sets	Names in Topos Theory
non-maximum many countable models	On distributions for countable models of quite o-minimal theories with non-maximum many countable models
nonexpansive semigroup	An invitation to proof mining: two applications in nonlinear operator theory
nonlinear analysis	An invitation to proof mining: two applications in nonlinear operator theory
Nonstandard analysis	Describing limits of bounded sequences of measurable functions via nonstandard analysis.
nonstandard methods	Nonstandard methods and construction of models of arithmetics
Nonstandard models of Arithmetic	Refuting 'Converse to Tarski' Conjecture
Normal numbers	Normal Numbers, Logic and Automata
normalization	A normalizing system of natural deduction for relevant logic
numerical existence property	Effectivity proprties of Intuitionistic Zermelo-Fraenkel Set Theory with DCS principle.
O
o-minimality	Recent directions in model theory
open colorings	Open colorings on generalized Baire spaces
optimization theory	An invitation to proof mining: two applications in nonlinear operator theory
Ordinal analysis	Canonical aspects of reflection principles
ordinal assignment	Strong Normalization for Simply Typed Lambda Calculus
outer measure	Transversal of full outer measure
P
PA above	Characterizing the continuous degrees
Pairing functions	Gödel's second incompleteness theorem from scratch
Paraconsistency	When Curry met Abel
paraconsistent reasoning	Reasoning abhorrently
paradox	The Notion of Paradox Systems of propositions referring to each other: a model-theoretic view How to make an infinite decision
Paradoxes of Intensionality	The Semanticist's Guide to Ramification
paradoxicality	Systems of propositions referring to each other: a model-theoretic view
Parallel Composition	Propositional Dynamic Logic for Bisimilar programs with Parallel Operator and Test
parthood	On the Decidability of Mereological Theories with Local Complementation
partial ordering	On the Decidability of Mereological Theories with Local Complementation
partition relations	Negative partition relations from cardinal invariants
PCF space	On pcf spaces which are not Fréchet-Urysohn
Peano arithmetic	On generalized Goodstein sequences
perfect set theorem	Open colorings on generalized Baire spaces
perfect subsets	On the computability of perfect subsets of sets with positive measure
Permutation invariance	Truth as a Logical Property
PERSON-TO-PERSON	Meanings of contradicts.
PERSON-TO-PROPOSITION	Meanings of contradicts.
Peterson Intermediate Syllogisms	An Analysis of Peterson's Intermediate Syllogisms with Caroll's Diagrammatic Method
phase semantics	A Proof-Theoretic Semantics for Disjunction
phenomenology	Brentano and Frege: The tunnel between analytic and continental theories of language with intentional inexistence and the judgement stroke.
Philosophical Logic	Diagrammatic Reasoning for Boolean Equations
philosophy	Are points (necessarily) unextended?
Pi^1_1-Comprehension	Type-Two Well-Ordering Principles and Pi^1_1-Comprehension
plausibility model	A plausibility model for regret games
plural	Plural Categoricals and Squares of Opposition
pluralism	Logical dynamism as a way of understanding plurality of logics
politics	Why Does Formal Deductive Logic Start With the Classical Greeks?
Polynomial functors	Polynomials and theories
Prawitz's conjecture	Intuitionistic logic is not complete for standard proof-theoretic semantics
predicativity	The extended predicative Mahlo Universe in Explicit Mathematics - model construction
prefix decidability	On prefix realizability problems of infinite words for natural subsets of context-free languages
presupposition	Plural Categoricals and Squares of Opposition
principal numbering	Hyperimmunity and $A$--computable numberings
proof complexity	On proof complexities for some classes of tautologies in Frege systems Propositional sequent systems of two valued classical logic and many valued logics are no monotonous.
proof mining	A quantitative analysis of a theorem by F.E.Browder guided by the bounded functional interpretation An invitation to proof mining: two applications in nonlinear operator theory Proof mining in convex optimization
proof nets	Non-decomposable connectives of Linear Logic
proof search	On Some Systems of Minimal Propositional Logic with History Mechanism
proof theoretic strength	The extended predicative Mahlo Universe in Explicit Mathematics - model construction
proof theory	Tomographs for Substructural Display Logic The extended predicative Mahlo Universe in Explicit Mathematics - model construction On generalized Goodstein sequences Type-Two Well-Ordering Principles and Pi^1_1-Comprehension Arithmetical transfinite Recursion and Relatives Canonical aspects of reflection principles
proof-theoretic semantics	Intuitionistic logic is not complete for standard proof-theoretic semantics A Proof-Theoretic Semantics for Disjunction
proper classes	Dathematics: a meta-isomorphic version of classic mathematics based on proper classes
proposition	Meanings of statement, proposition, and sentence.
PROPOSITION-TO-PROPOSITION	Meanings of contradicts.
Propositional Dynamic Logic	Propositional Dynamic Logic for Bisimilar programs with Parallel Operator and Test
propositional logic	How far did Avicenna get with propositional logic?
propositional proof theory	On proof complexities for some classes of tautologies in Frege systems
Provability	Gödel's second incompleteness theorem from scratch
Provability logics	Two theorems on provability logics
Provability predicates	Two theorems on provability logics
proximal point algorithm	Proof mining in convex optimization
pseudofinite	Definability in the group of infinitesimal rotations
public announcement logic	(Dynamic) epistemic interpretation for erotetic search scenarios
pushdown automaton	On prefix realizability problems of infinite words for natural subsets of context-free languages
Q
quantum mechanics	On Approximations and Eigenvectors - looking at Quantum Physics via Metric Ultraproducts
quite o-minimal theory	On distributions for countable models of quite o-minimal theories with non-maximum many countable models On algebras of distributions for binary formulas of quite o-minimal theories with non-maximum many countable models
quite o-minimality	On preserving properties under expanding models of quite o-minimal theories
quotient structures	Computable quotient presentations of models of arithmetic and set theory
R
Rado Conjecture	Set-theoretic reflection of mathematical properties
Ramification	The Semanticist's Guide to Ramification
Ramsey property	Infinite utility streams and irregular sets
Ramsey theory	Families on large index sets and applications to Banach spaces
Ramsey's Theorem	On the first-order strength of Ramsey's theorem in reverse mathematics Some Weak Yet Strong restrictions of Hindman's Theorem
random structures	Logical co-operation in multiplayer games
Rational reconstruction	Reasoning abhorrently
rationality	A plausibility model for regret games
real number computations	Generalized Finite Automata over the Real Numbers
Reasoning	Reasoning abhorrently
reasoning about belief	Dynamic Belief Logic Based on Evidential Observation
reconstruction results	Stone duality for infinitary first-order logic
recursion	Type Theory of Restricted Algorithms and Neural Networks
Recursive saturation	Remarks on satisfaction classes and recursive saturation
Reflection principles	Reflection principles, bounded induction and axiomatic truth theories. Canonical aspects of reflection principles Set-theoretic reflection of mathematical properties
Regret games	A plausibility model for regret games
Regular ultrafilters	Keisler's order via Boolean ultrapowers
relation algebras	Relation algebras, representability and relevant logics
RELATION VERB	Meanings of contradicts.
relative consistency proof	Effectivity proprties of Intuitionistic Zermelo-Fraenkel Set Theory with DCS principle.
Relative modalities	Connectives as relative modalities
relevant logic	A normalizing system of natural deduction for relevant logic
relevant logics	Relation algebras, representability and relevant logics
Renaissance Geometry	Euclidean Geometry in Renaissance
Replacement of Equivalents	Uniform Substitution and Replacement of Equivalents
representability	Relation algebras, representability and relevant logics
Rescher quantifier	Logical co-operation in multiplayer games
restrictions	Type Theory of Restricted Algorithms and Neural Networks
restrictiveness	Maddian interpretations and their derived notions of restrictiveness
reverse mathematics	On the first-order strength of Ramsey's theorem in reverse mathematics Caristi's fixed point theorem and strong systems of arithmetic Some new bounds on the strength of restricted versions of Hindman's Theorem Some Weak Yet Strong restrictions of Hindman's Theorem
right	Assertion and request
Rogers semilattice	Rogers semilattices in analytical hierarchy
Routley-Meyer semantics	Routley-Meyer semantics for natural implicative expansions of Kleene's strong three-valued matrix
Rule	Two “Styles” of axiomatization: Rules versus Axioms. A Modern Perspective.
Russian	EXPRESSING NATURAL LANGUAGE SEMANTICS IN PROLOG
S
Satisfaction Classes	Remarks on satisfaction classes and recursive saturation Refuting 'Converse to Tarski' Conjecture
schema mappings	Schema mappings: structural properties and limits
Schreier families	Families on large index sets and applications to Banach spaces
Second incompleteness theorem	Gödel's second incompleteness theorem from scratch
second order logic	Squeezing arguments and strong logics
second-order arithmetic	On the first-order strength of Ramsey's theorem in reverse mathematics
second-order language	Defining modal logics of relations between models
self-reference	Systems of propositions referring to each other: a model-theoretic view Revealing the 4D vector space within disquotational truth theory for self-reference statements
Semantics	The Semanticist's Guide to Ramification
semantics for modal logic	Avicenna sets up a modal logic with a Kripke semantics
semiotic triad	Meanings of statement, proposition, and sentence.
semiring	A modal operator in multi-modal mu-calculus and induced semiring structure
sentence	Meanings of statement, proposition, and sentence. EXPRESSING NATURAL LANGUAGE SEMANTICS IN PROLOG
sequence of sets	Limitwise monotonic reducibility between sequences of sets and Sigma-definability of abelian groups
sequent	On Some Systems of Minimal Propositional Logic with History Mechanism
Sequent calculus	Non-decomposable connectives of Linear Logic On the Admissibility of the Structural Rules in Kanger's Calculus with Restricted Equality Rules Cut-free completeness for modal mu-calculus Interpolation for modal mu-calculus
Sequentiality	On pcf spaces which are not Fréchet-Urysohn
session types	Multirole Logic
set theory	Dathematics: a meta-isomorphic version of classic mathematics based on proper classes The hereditarily ordinal definable sets in inner models with finitely many Woodin cardinals
sheaf models	Sheaf models of type theory
Sheaves	Topos Theory For Descriptive Modeling
Sigma-definability	On computability in hereditarily finite superstructures and computable analysis Limitwise monotonic reducibility between sequences of sets and Sigma-definability of abelian groups
sigma-homeomorphism	Applications of computability theory in topology
Sigma-reducibility	Limitwise monotonic reducibility between sequences of sets and Sigma-definability of abelian groups
Sigma_1-separation	On some fixed point statements over Kripke Platek
similarity	Some properties of central types for EPSCJ theories
Simplification of the 2nd Incompleteness Theorem	On the Provability of Consistency
simply typed lambda calulus	Strong Normalization for Simply Typed Lambda Calculus
SOL	How could a logician help solving the P =? NP problem?
Solovay model	Happy and mad families
Sorites paradox	The Notion of Paradox
speech-act	Meanings of statement, proposition, and sentence.
square of opposition	Plural Categoricals and Squares of Opposition
Squeezing arguments	Squeezing arguments and strong logics
stability	Some properties of central types for EPSCJ theories Recent directions in model theory
stability theory	Some VC-combinatorial aspects of definable set systems
stable theory	A note on small stable theories
Star combinatory calculus	A herbrandized functional interpretation of classical first-order logic
statement	Meanings of statement, proposition, and sentence.
stick principle	Negative partition relations from cardinal invariants
Stratified set theory	Algebraic new foundations
strengthening the induction hypothesis	When one must strengthen one's induction hypothesis
string type	Meanings of statement, proposition, and sentence.
strong convex theory	Some properties of central types for EPSCJ theories
strong logics	Squeezing arguments and strong logics
strong normalization	Strong Normalization for Simply Typed Lambda Calculus
strongly compact cardinal	Set-theoretic reflection of mathematical properties
strongly ergodic actions	Model theory of strongly ergodic actions
Structural Ramsey theory	Non-amenablility of automorphism groups of generic structures
structural rules	On the Admissibility of the Structural Rules in Kanger's Calculus with Restricted Equality Rules Investigating some effects of display property
submodel	Defining modal logics of relations between models
subrecursive hierarchies	On generalized Goodstein sequences
substructural logics	Tomographs for Substructural Display Logic
subsymmetric sequences	Families on large index sets and applications to Banach spaces
Subsystems of second order arithmetic	Arithmetical transfinite Recursion and Relatives
succinctness	Formula size games for modal logics
surreal numbers	Surreal differential calculus Transseries as surreal analytic functions
survey	Recent directions in model theory
Symbolic Dynamics	Reducibilities and Higman-like theorems in symbolic dynamics
Synthetic Method	On Hilbert’s Axiomatic Method
SysML	Topos Theory For Descriptive Modeling
T
Tautologies	A herbrandized functional interpretation of classical first-order logic
temporal logic	Avicenna sets up a modal logic with a Kripke semantics How far did Avicenna get with propositional logic?
Temporal reasoning	The Rise of Temporal Logic
Tennebaum phenomena	Computable quotient presentations of models of arithmetic and set theory
tense logic	Intuitionistic tense logic. Some remarks.
Test Operator	Propositional Dynamic Logic for Bisimilar programs with Parallel Operator and Test
the enumeration degrees	Characterizing the continuous degrees
theorem proving	On Some Systems of Minimal Propositional Logic with History Mechanism
Three-valued logic	Routley-Meyer semantics for natural implicative expansions of Kleene's strong three-valued matrix
Three-valued logics	Belnap-Dunn semantics for natural implicative expansions of Kleene's strong three-valued matrix
Timed systems	On the verification of timed systems – and beyond (1/3)
tomographs	Tomographs for Substructural Display Logic
Topos Theory	Topos Theory For Descriptive Modeling Names in Topos Theory
translation between logics	How could a logician help solving the P =? NP problem?
transseries	Surreal differential calculus Transseries as surreal analytic functions
transversal	Transversal of full outer measure
tree property	The tree property at the double successor of a singular cardinal The tree property at $\aleph_{\omega+2}$ with a finite gap
Tribes	On some categorical aspects of homotopy type theory
truth	Systems of propositions referring to each other: a model-theoretic view
Turing degrees	On the computability of perfect subsets of sets with positive measure
twin primes	Nonstandard methods and construction of models of arithmetics
type theory	Models of set theory in path categories Names in Topos Theory A Proof-Theoretic Semantics for Disjunction
types	Type Theory of Restricted Algorithms and Neural Networks
U
ultrafilter	Multirole Logic
ultrafilter equations	Stone duality and applications in computer science (1/3)
undecidability	On the Decidability of Mereological Theories with Local Complementation
Undefinability	Refuting 'Converse to Tarski' Conjecture
Uniform reflection scheme	Reflection principles, bounded induction and axiomatic truth theories.
Uniform substitution	Uniform Substitution and Replacement of Equivalents
Uniformization Rule	Effectivity proprties of Intuitionistic Zermelo-Fraenkel Set Theory with DCS principle.
univalence axiom	Sheaf models of type theory
Univalent Foundations	Two “Styles” of axiomatization: Rules versus Axioms. A Modern Perspective.
Universal Algebra	Reducibilities and Higman-like theorems in symbolic dynamics
Universal theories	Universal theories and compactly expandable models
UNIVERSALIZED-CONDITIONAL	Teaching universalized-conditionals and Hazen’s Theorem.
Unprovability of consistency formulae in PA	On the Provability of Consistency
utility streams	Infinite utility streams and irregular sets
V
Validity	The Notion of Paradox An Analysis of Peterson's Intermediate Syllogisms with Caroll's Diagrammatic Method
VC dimension	Some VC-combinatorial aspects of definable set systems
Volutionary Arithmetic	Volutionary deliberations
W
weak arithmetics	Nonstandard methods and construction of models of arithmetics
weak o-minimality	Definable connectedness and definable compactness in the weakly o-minimal context On preserving properties under expanding models of quite o-minimal theories
weak pigeonhole principle	Counting in weak theories
weakly compact	Adding a non-reflecting weakly compact set
weakly pre-complete c.e.preorders	A note on computably enumerable preorders
weakly precomplete ceers	Weakly precomplete dark computably enumerable equivalence relations
Weighted timed systems	On the verification of timed systems – and beyond (1/3)
Well-Ordering Principles	Type-Two Well-Ordering Principles and Pi^1_1-Comprehension
Wellfoundedness	On extending the general recursion theorem to non-wellfounded relations
Woodin cardinals	The hereditarily ordinal definable sets in inner models with finitely many Woodin cardinals
Y
Young measures	Describing limits of bounded sequences of measurable functions via nonstandard analysis.
Ł
Łukasiewicz logic	Łukasiewicz logic, with coefficients

Disclaimer | Powered by EasyChair Smart Program