English
Related papers

Related papers: Practical and Structural Infinitary Expansions

200 papers

Motivated by problems involving end extensions of models of set theory, we develop the rudiments of the power admissible cover construction (over ill-founded models of set theory), an extension of the machinery of admissible covers invented…

Logic · Mathematics 2022-03-28 Zachiri McKenzie , Ali Enayat

We give a syntactic characterization of abstract elementary classes (AECs) closed under intersections using a new logic with a quantifier for isomorphism types that we call structural logic: we prove that AECs with intersections correspond…

Logic · Mathematics 2019-05-10 Will Boney , Sebastien Vasey

A Ramsey-like theorem is a statement of the form ``For every 2-coloring of $[\mathbb{N}]^2$, there exists an infinite set~$H \subseteq \mathbb{N}$ such that $[H]^2$ avoids some pattern''. We prove that none of these statements are…

Logic · Mathematics 2026-05-12 Ahmed Mimouni , Ludovic Patey

We show that if we enrich first order logic by allowing quantification over isomorphisms between definable ordered fields the resulting logic, L(Q_{Of}), is fully compact. In this logic, we can give standard compactness proofs of various…

Logic · Mathematics 2016-09-06 Alan H. Mekler , Saharon Shelah

Generalized structural equations models (GSEMs) [Peters and Halpern 2021], are, as the name suggests, a generalization of structural equations models (SEMs). They can deal with (among other things) infinitely many variables with infinite…

Artificial Intelligence · Computer Science 2021-12-22 Joseph Y. Halpern , Spencer Peters

Logical frameworks are successful in modeling proof systems. Recently, CoLF extended the logical framework LF to support higher-order rational terms that enable adequate encoding of circular objects and derivations. In this paper, we…

Logic in Computer Science · Computer Science 2023-12-12 Zhibo Chen

Borel summable semiclassical expansions in 1D quantum mechanics are considered. These are the Borel summable expansions of fundamental solutions and of quantities constructed with their help. An expansion, called topological,is constructed…

Quantum Physics · Physics 2008-11-26 Stefan Giller

We explore \emph{semibounded} expansions of arbitrary ordered groups; namely, expansions that do not define a field on the whole universe. We introduce the notion of a \emph{semibounded} expansion of an arbitrary ordered group, extending…

Logic · Mathematics 2021-10-26 Alex Savatovsky

This paper focuses on the expressive power of disjunctive and normal logic programs under the stable model semantics over finite, infinite, or arbitrary structures. A translation from disjunctive logic programs into normal logic programs is…

Artificial Intelligence · Computer Science 2013-04-03 Heng Zhang , Yan Zhang

The notion of expansivity and its generalizations (measure expansive, measure positively expansive, continuum-wise expansive, countably-expansive) are well known for deterministic systems and can be a useful property for studying…

Dynamical Systems · Mathematics 2024-10-15 Rafael A. Bilbao , Marlon Oliveira , Eduardo Santana

We exhibit a connection between geometric stability theory and the classification of unstable structures at the level of simplicity and the $\mathrm{NSOP}_{1}$-$\mathrm{SOP}_{3}$ gap. Particularly, we introduce generic expansions $T^{R}$ of…

Logic · Mathematics 2023-05-31 Scott Mutchnik

We introduce a linear infinitary $\lambda$-calculus, called $\ell\Lambda_{\infty}$, in which two exponential modalities are available, the first one being the usual, finitary one, the other being the only construct interpreted…

Logic in Computer Science · Computer Science 2016-04-29 Ugo Dal Lago

In this paper, we conduct further studies on geometric and analytic properties of asymptotic expansion in measure. More precisely, we develop a machinery of Markov expansion and obtain an associated structure theorem for asymptotically…

Dynamical Systems · Mathematics 2022-12-21 Kang Li , Federico Vigolo , Jiawen Zhang

The proof theory and semantics of intuitionistic modal logics have been studied by Simpson in terms of Prawitz-style labelled natural deduction systems and Kripke models. An alternative to model-theoretic semantics is provided by…

Logic · Mathematics 2025-07-10 Yll Buzoku , David. J. Pym

We provide decidability and undecidability results on the model-checking problem for infinite tree structures. These tree structures are built from sequences of elements of infinite relational structures. More precisely, we deal with the…

Logic in Computer Science · Computer Science 2011-11-15 Alex Spelten , Wolfgang Thomas , Sarah Winter

We provide a co-free construction which adds elementary structure to a primary doctrine. We show that the construction preserves comprehensions and all the logical operations which are in the starting doctrine, in the sense that it maps a…

Logic · Mathematics 2014-01-31 Fabio Pasquali

We further develop the theory of layered semigroups, as introduced by Farah, Hindman and McLeod, providing a general framework to prove Ramsey statements about such a semigroup $S$. By nonstandard and topological arguments, we show Ramsey…

Combinatorics · Mathematics 2021-04-26 Jordan Mitchell Barrett

We expand the notion of characteristic formula to infinite finitely presentable subdirectly irreducible algebras. We prove that there is a continuum of varieties of Heyting algebras containing infinite finitely presentable subdirectly…

Logic in Computer Science · Computer Science 2012-08-14 Alex Citkin

A modified realisability interpretation of infinitary logic is formalised and proved sound in constructive type theory (CTT). The logic considered subsumes first order logic. The interpretation makes it possible to extract programs with…

Logic · Mathematics 2017-01-11 Erik Palmgren

In this paper we prove a general theorem showing the extension property for partial automorphisms (EPPA, also called the Hrushovski property) for classes of structures containing relations and unary functions, optionally equipped with a…

Combinatorics · Mathematics 2022-01-25 Jan Hubička , Matěj Konečný , Jaroslav Nešetřil