English
Related papers

Related papers: Lindenbaum-type Logical Structures

200 papers

Continuous first-order logic is used to apply model-theoretic analysis to analytic structures (e.g. Hilbert spaces, Banach spaces, probability spaces, etc.). Classical computable model theory is used to examine the algorithmic structure of…

Logic · Mathematics 2008-06-04 Wesley Calvert

This paper is devoted to the classification and studying properties of complex unital $3$-dimensional structurable algebras. We provide a complete list of non-isomorphic classes, identifying five algebras for type $(2, 1)$ and two algebras…

Rings and Algebras · Mathematics 2026-03-05 Kobiljon Abdurasulov , Maqpal Eraliyeva , Ivan Kaygorodov

We give an algebraic characterization of the tree languages that are defined by logical formulas using certain Lindstr\"om quantifiers. An important instance of our result concerns first-order definable tree languages. Our characterization…

Logic in Computer Science · Computer Science 2010-06-21 Zoltan Esik , Pascal Weil

We present a type theory combining both linearity and dependency by stratifying typing rules into a level for logics and a level for programs. The distinction between logics and programs decouples their semantics, allowing the type system…

Programming Languages · Computer Science 2025-10-08 Qiancheng Fu , Hongwei Xi

Traditional cognitive science rests on a foundation of classical logic and probability theory. This foundation has been seriously challenged by several findings in experimental psychology on human decision making. Meanwhile, the formalism…

Artificial Intelligence · Computer Science 2015-12-31 Diederik Aerts , Sandro Sozzo , Tomas Veloz

We study abstract intermediate justification logics, that is arbitrary intermediate propositional logics extended with a subset of specific axioms of (classical) justification logics. For these, we introduce various semantics by combining…

Logic · Mathematics 2020-08-18 Nicholas Pischke

We determine, up to the equivalence of first-order interdefinability, all structures which are first-order definable in the random partial order. It turns out that these structures fall into precisely five equivalence classes. We achieve…

This paper is a sequel to "Logical systems I: Lambda calculi through discreteness". It provides a general 2-categorical setting for extensional calculi and shows how intensional and extensional calculi can be related in logical systems. We…

Category Theory · Mathematics 2014-10-17 Michal R. Przybylek

The exposition of the theory of structure species in Bourbaki's tractate takes only a few pages but still is quite difficult. However, in the exercises, Bourbaki outlines another approach that is based on the notion of structure type rather…

General Mathematics · Mathematics 2018-12-11 Aslanbek Naziev

Underlying the theory of inferences, a primary task of logic is language analysis. Such a task can be understood as depending on a general theory of representation, taking as a starting point the idea that some entities (`` representations…

Logic in Computer Science · Computer Science 2023-07-21 Arnaud Plagnol

We investigate the expressive power of a Turing-complete logic based on game-theoretic semantics. By defining suitable fragments and variants of the logic, we obtain a range of natural characterizations for some fundamental families of…

Logic · Mathematics 2023-04-14 Antti Kuusisto

This paper investigates formal logics for reasoning about determinacy and independence. Propositional Dependence Logic D and Propositional Independence Logic I are recently developed logical systems, based on team semantics, that provide a…

Logic · Mathematics 2017-12-05 Valentin Goranko , Antti Kuusisto

Using the Hilbert-Bernays account as a spring-board, we first define four ways in which two objects can be discerned from one another, using the non-logical vocabulary of the language concerned. (These definitions are based on definitions…

History and Philosophy of Physics · Physics 2011-06-21 Adam Caulton , Jeremy Butterfield

The objective of this paper is to describe the structure of Zariski closed algebras, which provide a useful generalization to finite dimensional algebras in the study of representable algebras over finite fields. Our results include a…

Rings and Algebras · Mathematics 2011-09-23 Alexei Belov-Kanel , Louis H. Rowen , Uzi Vishne

In this paper we consider the class of truth-functional many-valued logics with a finite set of truth-values. The main result of this paper is the development of a new \emph{binary} sequent calculi (each sequent is a pair of formulae) for…

Logic in Computer Science · Computer Science 2011-03-08 Zoran Majkic

The purpose of this survey article is to introduce the reader to a connection between Logic, Geometry, and Algebra which has recently come to light in the form of an interpretation of the constructive type theory of Martin-L\"of into…

Category Theory · Mathematics 2010-10-12 Steve Awodey

The paper has a form of a survey and consists of three parts. It is focused on the relationship between the many-sorted theory, which leads to logical geometry and one-sorted theory, which is based on the important model-theoretic concepts.…

Logic · Mathematics 2014-06-13 Boris Plotkin , Eugene Plotkin

Using the notion of existentially closed structures, we obtain embedding theorems for groups and Lie algebras. We also prove the existence of some groups and Lie algebras with prescribed properties.

Group Theory · Mathematics 2014-05-07 M. Shahryari

For every univariate formula $\chi$ we introduce a lattices of intermediate theories: the lattice of $\chi$-logics. The key idea to define chi-logics is to interpret atomic propositions as fixpoints of the formula $\chi^2$, which can be…

Logic · Mathematics 2023-03-21 Gianluca Grilletti , Davide Emilio Quadrellaro

We study elementary modal logics, i.e. modal logic considered over first-order definable classes of frames. The classical semantics of modal logic allows infinite structures, but often practical applications require to restrict our…

Logic in Computer Science · Computer Science 2012-10-10 Jakub Michaliszyn , Jan Otop , Piotr Witkowski