Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 0711.4376

Independence-friendly cylindric set algebras

Allen L. Mann
View original source ↗Read source document ↗Export metadata ↓

Abstract

Independence-friendly logic is a conservative extension of first-order logic that has the same expressive power as existential second-order logic. In her Ph.D. thesis, Dechesne introduces a variant of independence-friendly logic called IFG logic. We attempt to algebraize IFG logic in the same way that Boolean algebra is the algebra of propositional logic and cylindric algebra is the algebra of first-order logic. We define independence-friendly cylindric set algebras and prove two main results. First, every independence-friendly cylindric set algebra over a structure has an underlying Kleene algebra. Moreover, the class of such underlying Kleene algebras generates the variety of all Kleene algebras. Hence the equational theory of the class of Kleene algebras that underly an independence-friendly cylindric set algebra is finitely axiomatizable. Second, every one-dimensional independence-friendly cylindric set algebra over a structure has an underlying monadic Kleene algebra. However, the class of such underlying monadic Kleene algebras does not generate the variety of all monadic Kleene algebras. Finally, we offer a conjecture about which subvariety of monadic Kleene algebras the class of such monadic Kleene algebras does generate.

Explore related subjects

math.LO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Allen L. Mann. 2007-11-27. Independence-friendly cylindric set algebras. https://doi.org/10.1093/jigpal%2Fjzp029

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

KEEP EXPLORING

Related papers

arXiv2026

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO↗
arXiv2026

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO↗
arXiv2026

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO↗