Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2205.06466

Strongly First Order, Domain Independent Dependencies: the Union-Closed Case

Pietro Galliani
View original source ↗Read source document ↗Export metadata ↓

Abstract

Team Semantics generalizes Tarski's Semantics by defining satisfaction with respect to sets of assignments rather than with respect to single assignments. Because of this, it is possible to use Team Semantics to extend First Order Logic via new kinds of connectives or atoms - most importantly, via dependency atoms that express dependencies between different assignments. Some of these extensions are more expressive than First Order Logic proper, while others are reducible to it. In this work, I provide necessary and sufficient conditions for a dependency atom that is domain independent (in the sense that its truth or falsity in a relation does not depend on the existence in the model of elements that do not occur in the relation) and union closed (in the sense that whenever it is satisfied by all members of a family of relations it is also satisfied by their union) to be strongly first order, in the sense that the logic obtained by adding them to First Order Logic is no more expressive than First Order Logic itself.

Explore related subjects

math.LO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Pietro Galliani. 2022-06-30. Strongly First Order, Domain Independent Dependencies: the Union-Closed Case. https://arxiv.org/abs/2205.06466

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Pointwise provable equality and the failure of composition

Montagna (1989) and Di Paola--Montagna (1991) claim that the algebraic systems $S'$ and $S'_T$, respectively, are categories. We show that the proposed composition is not independent of the choice of representatives. For every consistent recursively enumerable extension $T$ of Peano arithmetic ($\mathrm{PA}$), we exhibit two program indices that are pointwise provably equal in $T$ but yield inequivalent composites when each is run after the same program. Montagna's $S'$ is the case $T=\mathrm{PA}$. The failure already occurs for partial maps from $ω$ to itself. Weak totality and the proposed range assignment also depend on the choice of representatives. More generally, for consistent $T\supseteq\mathrm{PA}$, pointwise provable equality is a composition congruence exactly when $T$ proves every true $Π^0_1$ sentence, in which case it is extensional equality. This completeness condition fails for every consistent recursively enumerable $T\supseteq\mathrm{PA}$ by Gödel's second incompleteness theorem. For every extension $T\supseteq\mathrm{PA}$, the least composition congruence containing pointwise provable equality is extensional equality if $T$ is $Σ^0_1$-sound and the universal relation otherwise.

math.LO↗
arXiv2026

Natural Term Logic

In this paper we develop a formal system called Natural Term Logic (NTL). NTL aims to represent key aspects of the logical and grammatical mechanisms of natural language as well as grammatical transformations which preserve core logical meaning. NTL can be seen as a refinement of the ideas of Quine's paper `Variables Explained Away' and the technical concepts introduced by Bealer and Zalta. NTL is more fine-grained than Bealer's first-order intensional logic (BL): there is a many-to-one correspondence $ν$ between NTL terms and closed BL terms as well as a canonical map $β$ which assigns to each closed BL term a corresponding NTL term. The map $ν$ can be seen as assigning a core logical content of the NTL term. We define a series of reductions on NTL terms which intuitivelyy speaking capture meaning-preserving syntactic transformations ( transformations which preserved the basic logical meaning of a term) and our main result is that each NTL term $T$ reduces to a unique normal term $N$. The reductions fall into the structural, predicative and pushing-in categories. Predicative reductions decompose NTL terms so that predication is only applied to a primitive term (such terms are called prenormal). A key ingredient in the proof is the fact that $βνN = N$ when $N$ is normal. This suggests that within NTL the normal form of a term expresses the core logical content of the term.

math.LO↗
arXiv2026

Hyper-hyperfiniteness and complexity

We show that if there exists a countable Borel equivalence relation which is hyper-hyperfinite but not hyperfinite, then the complexity of hyperfinite countable Borel equivalence relationsis as high as possible, namely, $Σ^1_2$-complete. We also establish an implication between the question of the effectivity of hyperfiniteness and its complexity.

math.LO↗