中文
相关论文

相关论文: Disjoint $n$-amalgamation and pseudofinite countab…

200 篇论文

Recently, in Axioms 10(2): 119 (2021), a nonclassical first-order theory T of sets and functions has been introduced as the collection of axioms we have to accept if we want a foundational theory for (all of) mathematics that is not weaker…

综合数学 · 数学 2026-03-13 Marcoen J. T. F. Cabbolet , Adrian R. D. Mathias

A theory T is tight if different deductively closed extensions of T (in the same language) cannot be bi-interpretable. Many well-studied foundational theories are tight, including PA [Visser2006], ZF, Z2, and KM [enayat2017]. In this…

逻辑 · 数学 2023-05-16 Alfredo Roque Freire , Kameryn J. Williams

We develop some basic results about full amalgamation classes with intrinsic trascendentals. These classes have generics whose models may have finite subsets whose intrinsic closure is not contained in its algebraic closure. We will show…

逻辑 · 数学 2015-12-15 Justin Brody

Consider the expansion $T_S$ of a theory $T$ by a predicate for a submodel of a reduct $T_0$ of $T$. We present a setup in which this expansion admits a model companion $TS$. We show that the nice features of the theory $T$ transfer to…

逻辑 · 数学 2019-11-01 Christian d'Elbée

A complete first order theory of a relational signature is called monomorphic iff all its models are monomorphic (i.e. have all the $n$-element substructures isomorphic, for each positive integer $n$). We show that a complete theory…

逻辑 · 数学 2018-12-07 Miloš S. Kurilić

A condition, in two variants, is given such that if a property P satisfies this condition, then every logic which is at least as strong as first-order logic and can express P fails to have the compactness property. The result is used to…

逻辑 · 数学 2013-04-15 Vera Koponen

The Algebraic Dichotomy Conjecture states that the Constraint Satisfaction Problem over a fixed template is solvable in polynomial time if the algebra of polymorphisms associated to the template lies in a Taylor variety, and is NP-complete…

计算机科学中的逻辑 · 计算机科学 2015-07-01 Libor Barto , Marcin Kozik

Let 2<n\leq l<m< \omega. Let L_n denote first order logic restricted to the first n variables. We show that the omitting types theorem fails dramatically for the n--variable fragments of first order logic with respect to clique guarded…

逻辑 · 数学 2015-04-24 Tarek Sayed Ahmed

Generalizing the notion of a tight almost disjoint family, we introduce the notions of a {\em tight eventually different} family of functions in Baire space and a {\em tight eventually different set of permutations} of $\omega$. Such sets…

逻辑 · 数学 2024-05-22 Vera Fischer , Corey Bacal Switzer

Let $G$ be a closed highly homogeneous subgroup of $S_{\infty}$ not involving circular orderings. We show that the closure of a conjugacy class from $G$ contains a conjugacy class which is comeagre in it. Furthermore, we show that the…

逻辑 · 数学 2025-04-23 Monika Drzewiecka , Aleksander Ivanov , Bartosz Mokry

We propose a natural, bivariate, generalization of the nonsingular similarity relations considered by T. Fine. We also provide an enumeration formulae and a generating tree for those relations. The latter allow us to give a new bijection…

组合数学 · 数学 2009-09-29 Olivier Guibert , Sylvain Pelat-Alloin

In this paper we investigate using the methodology of algebraic logic, deep algebraic results to prove three new omitting types theorems for finite variable fragments of first order logic. As a sample, we show that it T is an L_n theory and…

逻辑 · 数学 2013-07-04 Tarek Sayed Ahmed

We give an almost entirely model-theoretic account of both Ramsey classes of finite structures and of generalized indiscernibles as studied in special cases in (for example) [7], [9]. We understand "theories of indiscernibles" to be special…

逻辑 · 数学 2012-10-30 Cameron Donnay Hill

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…

逻辑 · 数学 2025-12-25 Manuel Bodirsky , Bertalan Bodor , Paolo Marimon

We show that for any natural number $s$, there is a constant $\gamma$ and a subgraph-closed class having, for any natural $n$, at most $\gamma^n$ graphs on $n$ vertices up to isomorphism, but no adjacency labeling scheme with labels of size…

We show, assuming PD, that every complete finitely axiomatized second order theory with a countable model is categorical, but that there is, assuming again PD, a complete recursively axiomatized second order theory with a countable model…

逻辑 · 数学 2024-05-07 Tapio Saarinen , Jouko Väänänen , William Hugh Woodin

We study the fluted fragment of first-order logic which is often viewed as a multi-variable non-guarded extension to various systems of description logics lacking role-inverses. In this paper we show that satisfiable fluted sentences (even…

计算机科学中的逻辑 · 计算机科学 2024-12-02 Daumantas Kojelis

A class of large N SU(N) gauge theories on a compact manifold S^3 X R (with possible inclusion of adjoint matter) is known to show first order deconfinement transition at the deconfinement temperature. This includes the familiar example of…

高能物理 - 理论 · 物理学 2008-11-26 Pallab Basu , Anindya Mukherjee

We consider several ways of decomposing models into parts of bounded size forming a congruence over a base, and show that admitting any such decomposition is equivalent to mutual algebraicity at the level of theories. We also show that a…

逻辑 · 数学 2022-08-11 Samuel Braunfeld , Michael C Laskowski

We prove that for every simple theory $T$ (or even simple thick compact abstract theory) there is a (unique) compact abstract theory $T^\fP$ whose saturated models are the lovely pairs of $T$. Independence-theoretic results that were proved…

逻辑 · 数学 2009-02-05 Itaï Ben Yaacov
‹ 上一页 1 2 3 10 下一页 ›