Searcharxiv⌕ Search

arXiv · 2611.18977

Relational Semantics and Completeness for Onto-Epistemic Logic

Abstract

This paper investigates a relational semantics for onto-epistemic logic with two semi-negations. The frames carry two pairs of quasi-orders and two commuting involutions. Some frames have nondistributive lattices of stable sets. The four- and nine-valued entailments are recovered as joint entailment on two particular finite frames. Sound and complete binary consequence calculi are given for both component entailments and for joint entailment. The joint Lindenbaum algebra embeds subdirectly into the product of its two component quotients. This embedding shows that joint derivability is the intersection of the two component derivability relations. The finite model property is proved using Dedekind-MacNeille completion and a filter-ideal representation of the resulting lattice. All three entailments are decidable by interleaving the search for a derivation with the search for a finite countermodel.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Oleg Grigoriev. 2026-11-13. Relational Semantics and Completeness for Onto-Epistemic Logic. https://searcharxiv.com/abs/2611.18977

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related papers

A Dubnov-Ivanov-Nagata-Higman Theorem for NIP nilrings

We prove that NIP nilrings of bounded nilexponent are nilpotent. We also deduce that NIP $ω$-categorical $n$-Engel Lie algebras of characteristic $p>n$ are nilpotent, yielding a case of the Lie algebra analogous of Wilson conjecture for $ω$-categorical groups.

math.LO↗

Relative computability and definability for nonregular oracles

Classically, a set is computable from an oracle if both the set and its complement are computably enumerable (c.e.) relative to that oracle. We construct a countable nonstandard model of true arithmetic with sets A and X such that both A and its complement are c.e. relative to X, yet A is not pointwise Turing reducible to X. The Turing functionals used here are single-valued at every oracle. For regular oracles, we prove that the classical equivalence holds over ISigma_1. Two further phenomena, each known from earlier work, are realized with the same oracle X that witnesses our main separation. Strong and pointwise Turing reducibility differ for this X, and some Delta_1^X set is not X-c.e.

math.LO↗