arXiv 1401.32322014-01-14math.LOcs.LO

Hierarchies in independence and inclusion logic with strict semantics

Miika Hannula, Juha Kontinen

英文摘要：

We study the expressive power of fragments of inclusion and independence logic defined by restricting the number k of universal quantifiers in formulas. Assuming the so-called strict semantics for these logics, we relate these fragments of inclusion and independence logic to sublogics ESO_f(k\forall) of existential second-order logic, which in turn are known to capture the complexity classes NTIME_{RAM}(n^k).

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Hierarchies in independence logic

We study the expressive power of fragments of inclusion and independence logic defined either by restricting the number of universal quantifiers or the arity of inclusion and independence atoms in formulas. Assuming the so-called lax semantics for these logics, we relate these fragments of inclusion and independence logic to familiar sublogics of existential second-order logic. We also show that, with respect to the stronger strict semantics, inclusion logic is equivalent to existential second-order logic.

2013-04-16cs.LOmath.LO

Hierarchies in inclusion logic with lax semantics

We study the expressive power of fragments of inclusion logic under the so-called lax team semantics. The fragments are defined either by restricting the number of universal quantifiers or the arity of inclusion atoms in formulae. In case of universal quantifiers, the corresponding hierarchy collapses at the first level. Arity hierarchy is shown to be strict by relating the question to the study of arity hierarchies in fixed point logics.

2014-01-14cs.LOmath.LO

A remark on strict independence relations

We prove that if $T$ is a complete theory with weak elimination of imaginaries, then there is an explicit bijection between strict independence relations for $T$ and strict independence relations for $T^{\text{eq}}$. We use this observation to show that if $T$ is the theory of the Fraïssé limit of finite metric spaces with integer distances, then $T^{\text{eq}}$ has more than one strict independence relation. This answers a question of Adler [1, Question 1.7].

2016-03-02math.LO

Strict independence

We investigate the notions of strict independence and strict non-forking, and establish basic properties and connections between the two. In particular it follows from our investigation that in resilient theories strict non-forking is symmetric. Based on this study, we develop notions of weight which characterize NTP2, dependence and strong dependence. Many of our proofs rely on careful analysis of sequences that witness dividing. We prove simple characterizations of such sequences in resilient theories, as well as of Morley sequences which are witnesses. As a by-product we obtain information …

2014-09-30math.LO

Sharpening independence results for Huntington's affine geometry

We improve upon Huntington's affine geometry by showing that his independence proofs can be, in some cases, simplified. We carry out a systematic investigation of the strict notion of betweenness that Huntington employs (the three arguments are supposed to be distinct) by comparing it to McPhee's three axiom systems for the same intended class of structures, which employs weak betweenness (the arguments are permitted to be equal). Upon closely inspecting the proof that McPhee's axiom systems are equivalent to Huntington's (subject of course to the definition of weak betweenness in terms of str…

2013-12-16math.LO

Deducibility and Independence in Beklemishev's Autonomous Provability Calculus

Beklemishev introduced an ordinal notation system for the Feferman-Schütte ordinal $Γ_0$ based on the autonomous expansion of provability algebras. In this paper we present the logic $\textbf{BC}$ (for Bracket Calculus). The language of $\textbf{BC}$ extends said ordinal notation system to a strictly positive modal language. Thus, unlike other provability logics, $\textbf{BC}$ is based on a self-contained signature that gives rise to an ordinal notation system instead of modalities indexed by some ordinal given a priori. The presented logic is proven to be equivalent to $\textbf{RC}_{Γ_0}$, th…

2020-08-31math.LO

更多相关论文收起更多论文

Descriptive complexity of real computation and probabilistic independence logic

We introduce a novel variant of BSS machines called Separate Branching BSS machines (S-BSS in short) and develop a Fagin-type logical characterisation for languages decidable in non-deterministic polynomial time by S-BSS machines. We show that NP on S-BSS machines is strictly included in NP on BSS machines and that every NP language on S-BSS machines is a countable union of closed sets in the usual topology of R^n. Moreover, we establish that on Boolean inputs NP on S-BSS machines without real constants characterises a natural fragment of the complexity class existsR (a class of problems polyn…

2020-07-08cs.CCcs.LOmath.LO

开放归纳的子系统

Subsystems of Open Induction

TU Wien（维也纳工业大学）；Institute of Discrete Mathematics and Geometry（离散数学与几何研究所）

本研究聚焦与自动归纳定理证明方法紧密相关的开放归纳子系统，考察将归纳限制为原子公式等四类形式所得的系统，完整厘清其在算术语言及子语言下的包含与严格包含关系。

2026-10-06math.LO