Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2310.02035

Caracterización semántico-deductiva de la lógica doble LD y los gráficos existenciales Gamma-LD

Manuel Sierra Aristizábal
View original source ↗Read source document ↗Export metadata ↓

Abstract

This work presents the deductive system Double Propositional Logic, LD, along with the semantics of possible worlds that characterize it. LD includes an alternate affirmation operator and an alternate negation operator and is not valid for the principle of the excluded third when one of the disjunctions is one of the alternate operators. The LD system includes as theorems, the theorems of the Classic Propositional Logic LC. In LD, the intuitionist connec-tives are recovered from the classics and the alternates, which implies that, the LD system includes as theorems, the theorems of the Propositional Intuitionist Logic LI. It is rigorously and detailed to prove that theorems of con-sistency, validity and completeness. It illustrates LD's ability to fix a version of the liar's paradox, where LC and LI fail. Finally, the location of the LD system is precisely determined in relation to the systems that made it possi-ble to intuit the structure of LD, such as, Basic Logic for the Aristotelian Truth LBVA, the Logic of Tautologies LT and the Basic Logic for Truth and Falsehood LBVF. LD is characterized by Gamma-LD Existential Graphs, in the style of Peirce, so the semantics of possible worlds presented in this work also characterizes Gamma-LD.

Explore related subjects

math.LO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Manuel Sierra Aristizábal. 2023-10-12. Caracterización semántico-deductiva de la lógica doble LD y los gráficos existenciales Gamma-LD. https://arxiv.org/abs/2310.02035

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

KEEP EXPLORING

Related papers

arXiv2026

Bluebirds and mockingbirds cannot produce a fixed-point combinator

Let $B$ be the bluebird combinator with reduction rule $Bxyz \to_{w} x\left(yz\right)$, let $M$ be the mockingbird combinator with reduction rule $Mx \to_{w} xx$, and let $I$ be the identity bird combinator with reduction rule $Ix \to_{w} x$. A fixed-point combinator, called a sage bird by Smullyan, is a closed term $Y$ such that, for a fresh variable $x$, $Yx$ is equivalent to $x\left(Yx\right)$ under these reduction rules. For a fixed variable $x$, we construct an invariant $\mathrm{Tr}_{x}\left(u\right)$ of a $BMI$-term $u$ with respect to $\to_{w}$. This invariant traces the occurrences of $x$ in the leftmost-innermost reduction sequence of $u$. We then prove that $\mathrm{Tr}_{x}\left(Yx\right) \neq \mathrm{Tr}_{x}\left(x^{r}\left( Yx \right)\right)$ for every $x$-free $BMI$-term $Y$ and every $r\geq 1$. Consequently, there exists no fixed-point combinator in $BMI$-combinatory logic. This provides a negative answer to the problem posed by Smullyan in 1985.

math.LO↗
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

Compactness via Consistency Properties

We will use consistency properties to characterize strongly compact cardinals, first showing an adequate Model Existence Theorem for larger fragments.

math.LO↗