English
Related papers

Related papers: Completeness of infinitary heterogeneous logic

200 papers

This paper explores the space of (propositional) probabilistic logical languages, ranging from a purely `qualitative' comparative language to a highly `quantitative' language involving arbitrary polynomials over probability terms. While…

Logic · Mathematics 2023-08-17 Duligur Ibeling , Thomas Icard , Krzysztof Mierzewski , Milan Mossé

We revisit the old work of de Paiva on the models of the Lambek Calculus in dialectica models making sure that the syntactic details that were sketchy on the first version got completed and verified. We extend the Lambek Calculus with a…

Logic in Computer Science · Computer Science 2018-01-23 Valeria de Paiva , Harley Eades

Propositional formulas that are equivalent in intuitionistic logic, or in its extension known as the logic of here-and-there, have the same stable models. We extend this theorem to propositional formulas with infinitely long conjunctions…

Logic in Computer Science · Computer Science 2020-02-19 Amelia Harrison , Vladimir Lifschitz , Miroslaw Truszczynski

We generalize the finiteness theorem for the locus of Hodge classes with fixed self-intersection number, due to Cattani, Deligne, and Kaplan, from Hodge classes to self-dual classes. The proof uses the definability of period mappings in the…

Algebraic Geometry · Mathematics 2026-05-06 Benjamin Bakker , Thomas W. Grimm , Christian Schnell , Jacob Tsimerman

We present recent results on the model companions of set theory, placing them in the context of the current debate in the philosophy of mathematics. We start by describing the dependence of the notion of model companionship on the…

Logic · Mathematics 2024-05-29 Giorgio Venturi , Matteo Viale

We prove a strong conceptual completeness theorem (in the sense of Makkai) for the infinitary logic $\mathcal L_{\omega_1\omega}$: every countable $\mathcal L_{\omega_1\omega}$-theory can be canonically recovered from its standard Borel…

Logic · Mathematics 2019-08-06 Ruiyuan Chen

If kappa is strongly compact, lambda > kappa is regular, then (2^{< lambda})^+ --> (lambda+eta)^2_theta holds for eta,theta<kappa.

Logic · Mathematics 2007-05-23 Saharon Shelah

We generalize pp elimination for modules, or more generally abelian structures, to a continuous logic environment where the abelian structure is equipped with a homomorphism to a compact (Hausdorff) group. We conclude that the continuous…

Logic · Mathematics 2021-09-10 Nicolas Chavarria Gomez , Anand Pillay

The present paper constructs three new systems of clarithmetic (arithmetic based on computability logic --- see http://www.cis.upenn.edu/~giorgi/cl.html): CLA8, CLA9 and CLA10. System CLA8 is shown to be sound and extensionally complete…

Logic in Computer Science · Computer Science 2012-11-21 Giorgi Japaridze

We show that if the existence of a supercompact cardinal $\kappa$ with a weakly compact cardinal $\lambda$ above $\kappa$ is consistent, then the following are consistent as well (where $\mathfrak{t}(\kappa)$ and $\mathfrak{u}(\kappa)$ are…

Logic · Mathematics 2025-04-28 Radek Honzik , Sarka Stejskalova

The coupled entropy, $H_\kappa,$ is proven to uniquely satisfy the requirement that a generalized entropy be a measure of the uncertainty at the scale, $\sigma,$ for a class of non-exponential distributions. The coupled stretched…

Statistical Mechanics · Physics 2026-01-14 Kenric P. Nelson

Let $A$ be a finite or countable alphabet and let $\theta$ be literal (anti)morphism onto $A^*$ (by definition, such a correspondence is determinated by a permutation of the alphabet). This paper deals with sets which are invariant under…

Discrete Mathematics · Computer Science 2017-07-28 Jean Néraud , Carla Selmi

Motivated by the problem of finding finite versions of classical incompleteness theorems, we present some conjectures that go beyond ${\bf NP\neq co NP}$. These conjectures formally connect computational complexity with the difficulty of…

Logic · Mathematics 2017-05-22 Pavel Pudlak

We generalize the Hart-Shelah example \cite{HaSh:323} to higher infinitary logics. We build, for each natural number $k\geq 2$ and for each infinite cardinal $\lambda$, a sentence $\psi_k^\lambda$ of the logic $L_{(2^\lambda)^+,\omega}$…

Logic · Mathematics 2021-02-03 Saharon Shelah , Andres Villaveces

We prove that an $\omega$-categorical core structure primitively positively interprets all finite structures with parameters if and only if some stabilizer of its polymorphism clone has a homomorphism to the clone of projections, and that…

Logic in Computer Science · Computer Science 2016-02-16 Libor Barto , Michael Pinsker

We introduce refutationally complete superposition calculi for intentional and extensional clausal $\lambda$-free higher-order logic, two formalisms that allow partial application and applied variables. The calculi are parameterized by a…

Logic in Computer Science · Computer Science 2023-06-22 Alexander Bentkamp , Jasmin Blanchette , Simon Cruanes , Uwe Waldmann

If $\kappa$ is regular and $2^{<\kappa}\leq\kappa^+$, then the existence of a weakly presaturated ideal on $\kappa^+$ implies $\square^*_\kappa$. This partially answers a question of Foreman and Magidor about the approachability ideal on…

Logic · Mathematics 2020-10-01 Sean Cox , Monroe Eskew

We prove that the problem of deciding the consequence relation of the full Lambek calculus with weakening is complete for the class HAck of hyper-Ackermannian problems (i.e., level F_{\omega}^{\omega} of the ordinal-indexed hierarchy of…

Logic in Computer Science · Computer Science 2024-06-25 Vitor Greati , Revantha Ramanayake

We argue that we solved Hilbert's first problem positively (after reformulating it just to avoid the known consistency results) and give some applications. Let lambda to the revised power of kappa, denoted lambda^{[kappa]}, be the minimal…

Logic · Mathematics 2016-09-07 Saharon Shelah

In the literature on Kleene algebra, a number of variants have been proposed which impose additional structure specified by a theory, such as Kleene algebra with tests (KAT) and the recent Kleene algebra with observations (KAO), or make…

Logic in Computer Science · Computer Science 2024-08-07 Damien Pous , Jurriaan Rot , Jana Wagemaker