English
Related papers

Related papers: Failure of the Blok-Esakia Theorem in the monadic …

200 papers

Let $k$ be algebraically closed field of characteristic zero, let $G$ be a commutative algebraic group over $k$ such that the linear part of $G$ is isomorphic to $\mathbb{G}_a$, and let $X$ be a closed subvariety of $G$. We show that the…

Algebraic Geometry · Mathematics 2025-02-17 Jackson S. Morrow , Paul Vojta

We investigate non-wellfounded proof systems based on parsimonious logic, a weaker variant of linear logic where the exponential modality ! is interpreted as a constructor for streams over finite data. Logical consistency is maintained at a…

Logic in Computer Science · Computer Science 2025-09-03 Matteo Acclavio , Gianluca Curzi , Giulio Guerrieri

For any ordinal \Lambda, we can define a polymodal logic GLP(\Lambda), with a modality [\xi] for each \xi<\Lambda. These represent provability predicates of increasing strength. Although GLP(\Lambda) has no Kripke models, Ignatiev showed…

Logic · Mathematics 2012-04-24 David Fernández-Duque , Joost J. Joosten

In the present paper, the existence and multiplicity problems of extensions are addressed. The focus is on extension of the stable type. The main result of the paper is an elegant characterization of the existence and multiplicity of…

Artificial Intelligence · Computer Science 2007-05-23 Bart Verheij

We consider the one-variable fragment of first-order logic extended with Presburger constraints. The logic is designed in such a way that it subsumes the previously-known fragments extended with counting, modulo counting or cardinality…

Logic in Computer Science · Computer Science 2019-09-17 Bartosz Bednarczyk

Consider a linear ordering equipped with a finite sequence of monadic predicates. If the ordering contains an interval of order type \omega or -\omega, and the monadic second-order theory of the combined structure is decidable, there exists…

Logic in Computer Science · Computer Science 2015-07-01 Alexis Bes , Alexander Rabinovich

The classical Baldwin-Lachlan characterization of uncountably categorical theories is known to fail in continuous logic in that not every inseparably categorical theory has a strongly minimal set. Here we investigate these issues by…

Logic · Mathematics 2022-08-12 James Hanson

Our understanding about things is conceptual. By stating that we reason about objects, it is in fact not the objects but concepts referring to them that we manipulate. Now, so long just as we acknowledge infinitely extending notions such as…

Artificial Intelligence · Computer Science 2015-04-21 Ryuta Arisaka

We present two embeddings of infinite-valued Lukasiewicz logic L into Meyer and Slaney's abelian logic A, the logic of lattice-ordered abelian groups. We give new analytic proof systems for A and use the embeddings to derive corresponding…

Logic in Computer Science · Computer Science 2007-05-23 G. Metcalfe , N. Olivetti , D. Gabbay

The main purpose of this note is to prove an upper bound on the number of lattice points of a centrally symmetric convex body in terms of the successive minima of the body. This bound improves on former bounds and narrows the gap towards a…

Metric Geometry · Mathematics 2007-05-23 Martin Henk

We prove the log-Brunn-Minkowski conjecture for convex bodies with symmetries to $n$ independent hyperplanes, and discuss the equality case and the uniqueness of the solution of the related case of the logarithmic Minkowski problem. We also…

Functional Analysis · Mathematics 2022-03-04 Károly J. Böröczky , Pavlos Kalantzopoulos

Under Stone/Priestley duality for distributive lattices, Esakia spaces correspond to Heyting algebras which leads to the well-known dual equivalence between the category of Esakia spaces and morphisms on one side and the category of Heyting…

Category Theory · Mathematics 2014-08-06 Dirk Hofmann , Pedro Nora

One of the main claims of the paper is that Dirac's calculus and broader theories of physics can be treated as theories written in the language of Continuous Logic. Establishing its true interpretation (model) is a model theory problem. The…

Logic · Mathematics 2024-10-04 Boris Zilber

In this paper a conditional logic is defined and studied. This conditional logic, Deterministic Bayesian Logic, is constructed as a deterministic counterpart to the (probabilistic) Bayesian conditional. The logic is unrestricted, so that…

Logic in Computer Science · Computer Science 2011-11-09 Frederic Dambreville

Let X be a smooth variety over a field of positive characteristic, and let E be an overconvergent isocrystal on X. We establish a criterion for the existence of a "canonical logarithmic extension" of E to a good compactification of X. In…

Number Theory · Mathematics 2007-05-23 Kiran S. Kedlaya

This paper extends the literature on the strict-tolerant logical approach by applying its methods to intuitionistic and minimal logic. In short, the strict-tolerant approach modifies the usual notion of logical consequence by stipulating…

Logic in Computer Science · Computer Science 2025-09-15 Victor Barroso-Nascimento , German Mejia

MV-algebras are an algebraic semantics for Lukasiewicz logic and MV-algebras generated by a finite chain are Heyting algebras where the Godel implication can be written in terms of De Morgan and Moisil's modal operators. In our work, a…

Logic in Computer Science · Computer Science 2020-11-20 Aldo Figallo-Orellano , Juan Sebastian Slagter

We establish a general spectral gap theorem for actions of products of groups which may replace Kazhdan's property (T) in various situations. As a main application, we prove that a confined subgroup of an irreducible lattice in a higher…

Group Theory · Mathematics 2025-01-10 Uri Bader , Tsachik Gelander , Arie Levit

We recently performed cognitive experiments on conjunctions and negations of two concepts with the aim of investigating the combination problem of concepts. Our experiments confirmed the deviations (conceptual vagueness, underextension,…

Artificial Intelligence · Computer Science 2016-09-09 Diederik Aerts , Sandro Sozzo , Tomas Veloz

In this paper we extend the research programme in algebraic proof theory from axiomatic extensions of the full Lambek calculus to logics algebraically captured by certain varieties of normal lattice expansions (normal LE-logics).…