English
Related papers

Related papers: Limiting theories of substructures

200 papers

We define an extension of predicate logic, called Binding Logic, where variables can be bound in terms and in propositions. We introduce a notion of model for this logic and prove a soundness and completeness theorem for it. This theorem is…

Logic in Computer Science · Computer Science 2023-05-26 Gilles Dowek , Thérèse Hardin , Claude Kirchner

Restriction is a natural quasi-order on $d$-way tensors. We establish a remarkable aspect of this quasi-order in the case of tensors over a fixed finite field -- namely, that it is a well-quasi-order: it admits no infinite antichains and no…

Algebraic Geometry · Mathematics 2025-09-03 Andreas Blatter , Jan Draisma , Filip Rupniewski

A new mathematics, the constructive one, characterizes a singular limit as undecidable. Hence, a singular limit between two theories actually represents a difference between two different kinds of mathematics. This particular situation…

History and Philosophy of Physics · Physics 2020-12-23 Antonino Drago

Recent work in set theory indicates that there are many different notions of 'set', each captured by a different collection of axioms, as proposed by J. Hamkins in [Ham11]. In this paper we strive to give one class theory that allows for a…

Logic · Mathematics 2022-06-10 Alec Rhea

We consider partially ordered sets of combinatorial structures under consecutive orders, meaning that two structures are related when one embeds in the other such that `consecutive' elements remain consecutive in the image. Given such a…

Combinatorics · Mathematics 2026-04-22 Victoria Ironmonger , Nik Ruškuc

In this paper we study the number of finite topologies on an $n$-element set subject to various restrictions.

Combinatorics · Mathematics 2024-01-02 Eldar Fischer , Johann A. Makowsky

We introduce a new natural notion of convergence for permutations at any specified scale, in terms of the density of patterns of restricted width. In this setting we prove that limits may be chosen independently at a countably infinite…

Combinatorics · Mathematics 2021-10-20 David Bevan

One way of studying a relational structure is to investigate functions which are related to that structure and which leave certain aspects of the structure invariant. Examples are the automorphism group, the self-embedding monoid, the…

Logic · Mathematics 2011-05-31 Manuel Bodirsky , Michael Pinsker

We present a unified categorical treatment of completeness theorems for several classical and intuitionistic infinitary logics with a proposed axiomatization. This provides new completeness theorems and subsumes previous ones by G\"odel,…

Logic · Mathematics 2019-01-01 Christian Espíndola

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

We study the first-order almost-sure theories for classes of finite structures that are specified by homomorphically forbidding a set $\mathcal{F}$ of finite structures. If $\mathcal{F}$ consists of undirected graphs, a full description of…

Combinatorics · Mathematics 2024-06-24 Manuel Bodirsky , Colin Jahel

The apparent impossibility of extending non-relativistic quantum mechanics to a relativistic quantum theory is shown to be due to the insufficient structural richness of the field of complex numbers over which quantum mechanics is built. A…

General Physics · Physics 2012-04-17 Emile Grgin

A first-order theory $T$ is a model-complete core theory if every first-order formula is equivalent modulo $T$ to an existential positive formula; the core companion of a theory $T$ is a model-complete core theory $S$ such that every model…

Logic · Mathematics 2025-12-25 Manuel Bodirsky , Bertalan Bodor , Paolo Marimon

We propose a natural theory SO axiomatizing the class of sets of ordinals in a model of ZFC set theory. Both theories possess equal logical strength. Constructibility theory in SO corresponds to a natural recursion theory on ordinals.

Logic · Mathematics 2007-05-23 Peter Koepke , Martin Koerwien

Higher order set theory has been a topic of interest for some time, with recent efforts focused on the strength of second order set theories [KW16]. In this paper we strive to present one 'theory of collections' that allows for a formal…

Logic · Mathematics 2022-06-24 Alec Rhea

We note a parallel between some ideas of stable model theory and certain topics in finite combinatorics related to the sum-product phenomenon. For a simple linear group G, we show that a finite subset X with |X X \^{-1} X |/ |X| bounded is…

Logic · Mathematics 2011-05-17 Ehud Hrushovski

We present a method for constructing countable models of small theories and apply it to prove theorems on the maximal number of countable non-isomorphic models of linearly ordered theories.

Logic · Mathematics 2021-10-01 Bektur Baizhanov , Tatyana Zambarnaya

We investigate infinite sets that witness the failure of certain Ramsey-theoretic statements, such as Ramsey's or (appropriately phrased) Hindman's theorem; such sets may exist if one does not assume the Axiom of Choice. We obtain very…

Logic · Mathematics 2021-03-03 Joshua Brot , Mengyang Cao , David Fernández-Bretón

We investigate the theory of finite observables, i.e., resolutions of the finite-dimensional identity by means of positive operators, that have a physical interpretation in terms of measurement schemes. We focus on extremal and rank-one…

Quantum Physics · Physics 2019-07-01 Heinz-Jürgen Schmidt

Lie systems form a class of systems of first-order ordinary differential equations whose general solutions can be described in terms of certain finite families of particular solutions and a set of constants, by means of a particular type of…

Mathematical Physics · Physics 2013-03-13 J. F. Cariñena , J. de Lucas