Lars Kristiansen, Juvenal Murwanashyaka
We study first-order concatenation theory with bounded quantifiers. We give axiomatizations with interesting properties, and we prove some normal-form results. Finally, we prove a number of decidability and undecidability results.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
We consider a family U of finite universes. The second order quantifier Q_R, means for each u in U quantifying over a set of n(R)-place relations isomorphic to a given relation. We define a natural partial order on such quantifiers called interpretability. We show that for every Q_R, ever Q_R is interpretable by quantifying over subsets of u and one to one functions on u both of bounded order, or the logic L(Q_R) (first order logic plus the quantifier Q_R) is undecidable.
We analyse the pseudofinite monadic second order theory of words over a fixed finite alphabet. In particular we present an axiomatisation of this theory, working in a one-sorted first order framework. The analysis hinges on the fact that concatenation of words interacts nicely with monadic second order logic. More precisely, give a signature under which for each natural number k, equivalence of (monadic second order versions of) words with respect to formulas of quantifier depth at most k is a congruence for concatenation. We use our analysis to present an alternative proof of a theorem connec…
Using a variation of the rainbow construction and various pebble and colouring games, we prove that RRA, the class of all representable relation algebras, cannot be axiomatised by any first-order relation algebra theory of bounded quantifier depth. We also prove that the class At(RRA) of atom structures of representable, atomic relation algebras cannot be defined by any set of sentences in the language of RA atom structures that uses only a finite number of variables.
We generalize Cooper's method of quantifier elimination for classical Presburger arithmetic to give a new proof that all parametric Presburger families (as defined by Kevin Woods) are definable by formulas with polynomially bounded quantifiers in an expanded language with predicates for divisibility by f(t) for every polynomial f over the integers. In fact, this quantifier bounding method works more generally in expansions of Presburger arithmetic with multiplication by scalars from any ring of functions into Z.
We introduce a first-order theory of finite full binary trees and then identify decidable and undecidable fragments of this theory. We show that the analogue of Hilbert`s 10th Problem is undecidable by constructing a many-to-one reduction of Post`s Correspondence Problem. By a different method, we show that deciding truth of sentences with one existential quantifier and one bounded universal quantifier is undecidable.
We study a class of first-order theories whose complete quantifier-free types with one free variable either have a trivial positive part or are isolated by a positive quantifier-free formula--plus a few other technical requirements. The theory of vector spaces and the theory fields are examples. We prove the amalgamation property and the existence of a model-companion. We show that the model-companion is strongly minimal. We also prove that the length of any increasing sequence of prime types is bounded, so every formula has finite Krull dimension.
We extend first-order logic to include variadic function symbols, and prove a substitution lemma. Two applications are given: one to bounded quantifier elimination and one to the definability of certain Borel sets.
We prove that the number of distinct homotopy types of limits of one-parameter semi-algebraic families of closed and bounded semi-algebraic sets is bounded singly exponentially in the additive complexity of any quantifier-free first order formula defining the family. As an important consequence, we derive that the number of distinct homotopy types of semi-algebraic subsets of $\mathbb{R}^k$ defined by a quantifier-free first order formula $Φ$, where the sum of the additive complexities of the polynomials appearing in $Φ$ is at most $a$, is bounded by $2^{(k+a)^{O(1)}}$. This proves a conjectur…
This paper proves Buss's hierarchy of bounded arithmetics $S^1_2 \subseteq S^2_2 \subseteq \cdots \subseteq S^i_2 \subseteq \cdots$ does not entirely collapse. More precisely, we prove that, for a certain $D$, $S^1_2 \subsetneq S^{2D+5}_2$ holds. Further, we can allow any finite set of true quantifier free formulas for the BASIC axioms of $S^1_2, S^2_2, \ldots$. By Takeuti's argument, this implies $\mathrm{P} \neq \mathrm{NP}$. Let $\mathbf{Ax}$ be a certain formulation of BASIC axioms. We prove that $S^1_2 \not\vdash \mathrm{Con}(\mathrm{PV}^-_1(D) + \mathbf{Ax})$ for sufficiently large $D$, …
Enumerating Error Bounded Polytime Algorithms Through Arithmetical Theories
本文扩展算术语言刻画多项式时间随机函数，通过在逻辑系统内化误差界限检查，提出BPP的两种新刻画并引入可有效枚举子类BPP_T，最后证明多项式恒等式测试属于BPP_T。
We say that a first order formula $Φ$ defines a graph $G$ if $Φ$ is true on $G$ and false on every graph $G'$ non-isomorphic with $G$. Let $D(G)$ be the minimal quantifier rank of a such formula. We prove that, if $G$ is a tree of bounded degree or a Hamiltonian (equivalently, 2-connected) outerplanar graph, then $D(G)=O(\log n)$, where $n$ denotes the order of $G$. This bound is optimal up to a constant factor. If $h$ is a constant, for connected graphs with no minor $K_h$ and degree $O(\sqrt n/\log n)$, we prove the bound $D(G)=O(\sqrt n)$. This result applies to planar graphs and, more gene…
In this paper, we study zero-one laws for the Erdős--Rényi random graph model $G(n,p)$ in the case when $p = n^{-α}$ for $α>0$. For a given class $\mathcal{K}$ of logical sentences about graphs and a given function $p=p(n)$, we say that $G(n,p)$ obeys the zero-one law (w.r.t. the class $\mathcal{K}$) if each sentence $φ\in\mathcal{K}$ either a.a.s. true or a.a.s. false for $G(n,p)$. In this paper, we consider first order properties and monadic second order properties of bounded \textit{quantifier depth} $k$, that is, the length of the longest chain of nested quantifiers in the formula expressi…
We examine the first order structure of pregeometries of structures built via Hrushovski constructions. In particular, we show that the class of flat pregeometries is an amalgamation class such that the pregeometry of the unbounded arity Hrushovski construction is precisely its generic. We show that the generic is saturated, provide an axiomatization for its theory, show that the theory is $ω$-stable, and has quantifier-elimination down to boolean combinations of $\exists\forall$-formulas. We show that the pregeometries of the bounded-arity Hrushovski constructions satisfy the same theory, and…
We prove that if T is a theory of large, bounded, fields of characteristic zero, with almost quantifier elimination, and T_D is the model companion of T + "D is a derivation", then for any model U of T_D, and differential subfield K of U whose field of constants is a model of T, and linear differential equation DY = AY over K, there is a Picard-Vessiot extension L of K for the equation which is embedded in U over K Likewise for logarithmic differential equations over K on connected algebraic groups over the constants of K and the corresponding strongly normal extensions of K.
Continuous first-order logic of abstract harmonic spaces
本文研究抽象调和空间理论，探讨调和映射在光滑流形上的饱和条件，通过U-秩和大基数的初等饱和性对n≤2的流形进行特征化，并讨论极集的等价条件及调和测度与Keisler测度的映射关系。
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。