English
Related papers

Related papers: A long EF-equivalence non isomorphic models

200 papers

Combinatorial games are widely used in finite model theory, constraint satisfaction, modal logic and concurrency theory to characterize logical equivalences between structures. In particular, Ehrenfeucht-Fraisse games, pebble games, and…

Logic in Computer Science · Computer Science 2021-07-27 Samson Abramsky , Nihil Shah

The categorical models of the differential lambda-calculus are additive categories because of the Leibniz rule which requires the summation of two expressions. This means that, as far as the differential lambda-calculus and differential…

Logic in Computer Science · Computer Science 2024-02-14 Thomas Ehrhard

We investigate in ZFC what can be the family of large enough cardinals mu in which an a.e.c. K is categorical or even just solvable. We show that for not few cardinals lambda<mu there is a superlimit model in K_lambda. Moreover, our main…

Logic · Mathematics 2008-08-25 Saharon Shelah

Recently, we have shown that satisfiability for $\mathsf{ECTL}^*$ with constraints over $\mathbb{Z}$ is decidable using a new technique. This approach reduces the satisfiability problem of $\mathsf{ECTL}^*$ with constraints over some…

Logic in Computer Science · Computer Science 2015-02-25 Claudia Carapelle , Shiguang Feng , Alexander Kartzow , Markus Lohrey

Motivated by recent results and questions of D. Raghavan and S. Shelah, we present ZFC theorems on the bounding and various almost disjointness numbers, as well as on reaping and dominating families on uncountable, regular cardinals. We…

Logic · Mathematics 2018-03-09 Vera Fischer , Daniel T. Soukup

We show relative to strong hypotheses that patterns of compact cardinals in the universe, where a compact cardinal is one which is either strongly compact or supercompact, can be virtually arbitrary. Specifically, we prove if V is a model…

Logic · Mathematics 2007-05-23 Arthur W. Apter

We give a characterization of Pfaffian graphs in terms of even orientations, extending the characterization of near bipartite non--pfaffian graphs by Fischer and Little \cite{FL}. Our graph theoretical characterization is equivalent to the…

Combinatorics · Mathematics 2021-10-07 Marièn Abreu , Domenico Labbate , Federico Romaniello , John Sheehan

Non-alternating Hamiltonian Lie algebras in three variables over a perfect field of characteristic 2 are considered. A classification of non-alternating Hamiltonian forms over an algebra of divided powers in three variables and of the…

Rings and Algebras · Mathematics 2021-01-05 A. V. Kondrateva

Two structures are said to be equimorphic if each embeds in the other. Such structures cannot be expected to be isomorphic, and in this paper we investigate the special case of linear orders, here also called chains. In particular we…

Combinatorics · Mathematics 2014-07-11 C. Laflamme , M. Pouzet , R. Woodrow

It is known that the canonical double cover of any connected nonbipartite graph have an automorphism group of the form $H \rtimes \mathbb{Z}_2$, where $H$ is the set of automorphism which preserve bipartite parts. We construct connected…

Combinatorics · Mathematics 2024-06-11 Bartłomiej Bychawski

We generalise the $\alpha$-Ramsey cardinals introduced in Holy and Schlicht (2018) for cardinals $\alpha$ to arbitrary ordinals $\alpha$, and answer several questions posed in that paper. In particular, we show that $\alpha$-Ramseys are…

Logic · Mathematics 2018-10-31 Dan Saattrup Nielsen , Philip Welch

We introduce a refinement of the usual Ehrenfeucht-Fra\"{\i}ss\'e game. The new game will help us make finer distinctions than the traditional one. In particular, it can be used to measure the size formulas needed for expressing a given…

Logic · Mathematics 2012-08-24 Lauri Hella , Jouko Väänänen

For a given function $F$ from $\mathbb F_{p^n}$ to itself, determining whether there exists a function which is CCZ-equivalent but EA-inequivalent to $F$ is a very important and interesting problem. For example, K\"olsch \cite{KOL21} showed…

Information Theory · Computer Science 2023-08-11 Jaeseong Jeong , Namhun Koo , Soonhak Kwon

We show that it is not provable in ZFC that any two countable elementarily equivalent structures have isomorphic ultrapowers relative to some ultrafilter on omega .

Logic · Mathematics 2008-02-03 Saharon Shelah

Suppose lambda is a singular cardinal of uncountable cofinality kappa. For a model M of cardinality lambda, let No(M) denote the number of isomorphism types of models N of cardinality lambda which are L_{infty lambda}-equivalent to M. In…

Logic · Mathematics 2016-09-07 Saharon Shelah , Pauli Väisänen

The construction of Non Abelian affine Toda models is discussed in terms of its underlying Lie algebraic structure. It is shown that a subclass of such non conformal two dimensional integrable models naturally leads to the construction of a…

High Energy Physics - Theory · Physics 2009-11-10 J. F. Gomes , G. M. Sotkov , A. H. Zimerman

If $\Gamma$ is an irreducible non-uniform higher-rank characteristic zero arithmetic lattice (for example, $SL_n(\mathbb{Z})$, $n \geq 3$) and $\Lambda$ is a finitely generated group that is elementarily equivalent to $\Gamma$, then…

Group Theory · Mathematics 2017-09-11 Nir Avni , Alexander Lubotzky , Chen Meiri

The existing observational data on possible variations of fundamental physical constants (FPC) confirm more or less confidently only a variability of the fine structure constant $\alpha$ in space and time. A model construction method is…

General Relativity and Quantum Cosmology · Physics 2015-06-12 K. A. Bronnikov , V. N. Melnikov , S. G. Rubin , I. V. Svadkovsky

Assuming the existence of a strong cardinal, we find a model of ZFC in which for each uncountable regular cardinal $\lambda,$ there is no universal graph of size $\lambda$.

Logic · Mathematics 2022-06-02 Mohammad Golshani

A forcing extension may create new isomorphisms between two models of a first order theory. Certain model theoretic constraints on the theory and other constraints on the forcing can prevent this pathology. A countable first order theory is…

Logic · Mathematics 2016-09-06 John T. Baldwin , Michael C. Laskowski , Saharon Shelah
‹ Prev 1 3 4 5 6 7 10 Next ›