English
Related papers

Related papers: Hanf Locality and Invariant Elementary Definabilit…

200 papers

We introduce a new logic, called \emph{cluster first-order logic}, a restricted fragment of first-order logic specifically designed to study order invariance. An order-invariant formula is one on a vocabulary that contains an order;…

Logic in Computer Science · Computer Science 2026-05-01 Fatemeh Ghasemi , Julien Grange

Local-order-invariant (first-order) logic is an extension of first-order logic where formulae have access to a ternary local order relation on the Gaifman graph, provided that the truth value does not depend on the specific order relation…

Logic · Mathematics 2025-12-03 Derek Aoki

We study the expressive power of the two-variable fragment of order-invariant first-order logic. This logic departs from first-order logic in two ways: first, formulas are only allowed to quantify over two variables. Second, formulas can…

Logic in Computer Science · Computer Science 2022-07-12 Julien Grange

We study Gaifman locality and Hanf locality of an extension of first-order logic with modulo p counting quantifiers (FO+MOD_p, for short) with arbitrary numerical predicates. We require that the validity of formulas is independent of the…

Logic in Computer Science · Computer Science 2019-03-14 Frederik Harwath , Nicole Schweikardt

We study first-order logic over unordered structures whose elements carry a finite number of data values from an infinite domain which can be compared wrt. equality. As the satisfiability problem for this logic is undecidable in general, in…

Logic in Computer Science · Computer Science 2022-09-22 Benedikt Bollig , Arnaud Sangnier , Olivier Stietel

We show that if a nontrivial group admits a locally invariant ordering, then it admits uncountably many locally invariant orderings. For the case of a left-orderable group, we provide an explicit construction of uncountable families of…

Group Theory · Mathematics 2022-08-03 Idrissa Ba , Adam Clay , Ian Thompson

For any first order theory T we construct a Boolean valued model M, in which precisely the T--provable formulas hold, and in which every (Boolean valued) subset which is invariant under all automorphisms of M is definable by a first order…

Logic · Mathematics 2016-09-07 Carsten Butz , Ieke Moerdijk

This paper investigates the expressiveness of a fragment of first-order sentences in Gaifman normal form, namely the positive Boolean combinations of basic local sentences. We show that they match exactly the first-order sentences preserved…

Logic in Computer Science · Computer Science 2022-04-06 Aliaume Lopez

The Svenonius theorem describes the (first-order) definability in a structure in terms of permutations preserving the relations of elementary extensions of the structure. In the present paper we prove a version of this theorem using…

Logic · Mathematics 2016-05-17 A. L. Semenov , S. F. Soprunov

Recently, a classical approach to continuous structures has been proposed in [ABBMZ] and [Z] that extends the class of structures falling under the scope of [HI] or [BBHU]. These articles introduce the notion of structures with a standard…

Logic · Mathematics 2025-10-27 Silvia Barbina , Riccardo Camerlo , Domenico Zambella

Many-valued models generalise the structures from classical model theory by defining truth values for a model with an arbitrary algebra. Just as algebraic varieties provide semantics for many non-classical propositional logics, models…

Logic in Computer Science · Computer Science 2026-01-29 James Carr

We study first-order logic over unordered structures whose elements carry a finite number of data values from an infinite domain. Data values can be compared wrt.\ equality. As the satisfiability problem for this logic is undecidable in…

Logic in Computer Science · Computer Science 2024-08-07 Benedikt Bollig , Arnaud Sangnier , Olivier Stietel

We study invariant local expansion operators for conflict-free and admissible sets in Abstract Argumentation Frameworks (AFs). Such operators are directly applied on AFs, and are invariant with respect to a chosen "semantics" (that is…

Artificial Intelligence · Computer Science 2018-08-01 Stefano Bistarelli , Francesco Santini , Carlo Taticchi

Generalizing a theorem of Campercholi, we characterize, in syntactic terms, the ranges of epimorphisms in an arbitrary class of similar first-order structures (as opposed to an elementary class). This allows us to strengthen a result of…

Logic · Mathematics 2020-05-26 T. Moraschini , J. G. Raftery , J. J. Wannenburg

Order-invariant formulas access an ordering on a structure's universe, but the model relation is independent of the used ordering. Order invariance is frequently used for logic-based approaches in computer science. Order-invariant formulas…

Logic in Computer Science · Computer Science 2016-06-22 Michael Elberfeld , Marlin Frickenschmidt , Martin Grohe

We define the continuous modeling property for first-order structures and show that a first-order structure has the continuous modelling property if and only if its age has the embedding Ramsey property. We use generalized indiscernible…

Logic · Mathematics 2024-05-31 Adrián Portillo Fernández

The relations and differences between various classification problems arising in the context of local two-dimensional conformal QFT, modular invariants, and subfactors are discussed. The extent to which locality implies modular invariance,…

Mathematical Physics · Physics 2007-05-23 K. -H. Rehren

We introduce the notion of \emph{topo-symmetric extensions} of topological groups, a new generalization of classical group extensions that incorporates both topological and symmetry constraints. We define morphisms between such extensions,…

General Mathematics · Mathematics 2025-10-02 Es-said En-naoui

We propose a deepening of the relativity principle according to which the invariant arena for non-quantum physics is a phase space rather than spacetime. Descriptions of particles propagating and interacting in spacetimes are constructed by…

High Energy Physics - Theory · Physics 2015-05-20 Giovanni Amelino-Camelia , Laurent Freidel , Jerzy Kowalski-Glikman , Lee Smolin

It is a common misconception that spacetime discreteness necessarily implies a violation of local Lorentz invariance. In fact, in the causal set approach to quantum gravity, Lorentz invariance follows from the specific implementation of the…

General Relativity and Quantum Cosmology · Physics 2014-04-08 Lisa Glaser , Sumati Surya
‹ Prev 1 2 3 10 Next ›