English
Related papers

Related papers: Practical and Structural Infinitary Expansions

200 papers

Each Multiplicative Exponential Linear Logic (MELL) proof-net can be expanded into a differential net, which is its Taylor expansion. We prove that two different MELL proof-nets have two different Taylor expansions. As a corollary, we prove…

Logic in Computer Science · Computer Science 2023-06-22 Daniel de Carvalho

We characterise the existentially closed models of the theory of exponential fields. They do not form an elementary class, but can be studied using positive logic. We find the amalgamation bases and characterise the types over them. We…

Logic · Mathematics 2021-01-19 Levon Haykazyan , Jonathan Kirby

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

The classifying topos of a geometric theory is a topos such that geometric morphisms into it correspond to models of that theory. We study classifying toposes for different infinitary logics: first-order, sub-first-order (i.e. geometric…

Category Theory · Mathematics 2023-12-20 Mark Kamsma

We study various formulations of the completeness of first-order logic phrased in constructive type theory and mechanised in the Coq proof assistant. Specifically, we examine the completeness of variants of classical and intuitionistic…

Logic in Computer Science · Computer Science 2021-12-15 Yannick Forster , Dominik Kirst , Dominik Wehr

In this article, we introduce the notion of a curved absolute $\mathcal{L}_\infty$-algebra, a structure that behaves like a curved $\mathcal{L}_\infty$-algebra where all infinite sums of operations are well-defined by definition. We develop…

Algebraic Topology · Mathematics 2024-05-01 Victor Roca i Lucio

We extend some of our earlier results on the interconnection between ultrafilter extensions, and ultrapowers. Throughout we restrict ourselves to relational structures with one binary relation. Recently it was shown that for bounded…

Logic · Mathematics 2025-02-25 Zalán Molnár

The class of finite distributive lattices, as many other classes of structures, does not have the Ramsey property. It is quite common, though, that after expanding the structures with appropriately chosen linear orders the resulting class…

Combinatorics · Mathematics 2018-02-06 Dragan Mašulović

We study the complexity of isomorphism of classes of metric structures using methods from infinitary continuous logic. For Borel classes of locally compact structures, we prove that if the equivalence relation of isomorphism is potentially…

Logic · Mathematics 2021-09-20 Andreas Hallbäck , Maciej Malicki , Todor Tsankov

We investigate the extent of second order characterizable structures by extending Shelah's Main Gap dichotomy to second order logic. For this end we consider a countable complete first order theory T. We show that all sufficiently large…

Logic · Mathematics 2012-08-28 Tapani Hyttinen , Kaisa Kangas , Jouko Väänänen

In previous papers on this project a general static logical framework for formalizing and mechanizing set theories of different strength was suggested, and the power of some predicatively acceptable theories in that framework was explored.…

Logic in Computer Science · Computer Science 2023-06-22 Arnon Avron , Liron Cohen

We consider finite relational signatures $\tau \subseteq \sigma$, a sequence of finite base $\tau$-structures $(\mathcal{B}_n : n \in \mathbb{N})$ the cardinalities of which tend to infinity and such that, for some number $\Delta$, the…

Logic · Mathematics 2025-11-11 Vera Koponen

Lawvere showed that generalised metric spaces are categories enriched over $[0, \infty]$, the quantale of the positive extended reals. The statement of enrichment is a quantitative analogue of being a preorder. Towards seeking a logic for…

Logic in Computer Science · Computer Science 2024-02-14 Giorgio Bacci , Radu Mardare , Prakash Panangaden , Gordon Plotkin

We propose modal Markov logic as an extension of propositional Markov logic to reason under the principle of maximum entropy for modal logics K45, KD45, and S5. Analogous to propositional Markov logic, the knowledge base consists of…

Logic in Computer Science · Computer Science 2013-10-29 Tivadar Papai , Henry Kautz , Daniel Stefankovic

A first-order structure $M$ is said to have the infinite sunflower property if, for each $k \in \mathbb{N}_+$ and each structure $M' \cong M$ whose elements are $k$-sets, there is $S \subseteq M'$, $S \cong M$, such that $S$ is a sunflower:…

Combinatorics · Mathematics 2026-03-10 Rob Sullivan , Jeroen Winkel

We develop general machinery to cast the class of potential canonical Scott sentences of an infinitary sentence $\Phi$ as a class of structures in a related language. From this, we show that $\Phi$ has a Borel complete expansion if and only…

Logic · Mathematics 2023-03-30 Michael C. Laskowski , Douglas S. Ulrich

We obtain modal completeness of the interpretability logics ILP_0 and ILR w.r.t. generalized Veltman semantics. Our proofs are based on the notion of smart (full) labels. We also give shorter proofs of completeness w.r.t. generalized…

Logic · Mathematics 2019-07-10 Luka Mikec , Mladen Vuković

We prove an infinite Ramsey theorem for noncommutative graphs realized as unital self-adjoint subspaces of linear operators acting on an infinite dimensional Hilbert space. Specifically, we prove that if V is such a subspace, then provided…

Operator Algebras · Mathematics 2017-11-28 Matthew Kennedy , Taras Kolomatski , Daniel Spivak

The Expansion property considered by researchers in Social Choice is shown to correspond to a logical property of nonmonotonic consequence relations that is the {\em pure}, i.e., not involving connectives, version of a previously known weak…

Artificial Intelligence · Computer Science 2007-05-23 Daniel Lehmann

An elementary rheory of concatenation is introduced and used to establish mutual interpretability of Robinson arithmetic, Minimal Predicative Set Theory, the quantifier-free part of Kirby's finitary set theory, and Adjunctive Set Theory,…

Logic · Mathematics 2017-07-13 Zlatan Damnjanovic