Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.24203

A Kleene-inspired sequent system for a minimal logic of evidence and truth

Nino Grandinetti·Abilio Rodrigues
View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper investigates the proof theory of the logic of evidence and truth LETFm, with the aim of obtaining a sequent calculus consisting only of logical rules, suitable for a simple bottom-up decision procedure. We begin with G1f, a sequent system containing structural rules, which makes explicit the main difficulties in obtaining a fully logical and decidable calculus for LETFm. We then introduce G3f, a G3-style system obtained from by applying Kleene's trick, which absorbs contraction into the logical rules by adding the principal formula of the rule to its premises.

Explore related subjects

math.LO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nino Grandinetti, Abilio Rodrigues. 2026-10-16. A Kleene-inspired sequent system for a minimal logic of evidence and truth. https://arxiv.org/abs/2610.24203

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

KEEP EXPLORING

Related papers

arXiv2026

Weakly uniform computable categoricity and function composition

We introduce the definition of a weakly $X$-uniformly $Y$-computably categorical structure, relativizing a definition of Kudinov (1996), and show that this relativized notion is closely related to the 2-dimensional complexity of the pairs of partial functions $(f,g)$ with the property that the composition $g\circ f$ simulates convergent $\emptyset'$-oracle computations. We develop a general theory for computing via composition and use it to prove results about the surprisingly complex weakly uniform categoricity spectrum of the structure $(ω,S)$ where $S(n)=n+1$. Namely, that $(ω,S)$ is w.$X$.u.$Y$.c.c. for some $X\not\geq_T\emptyset'$ and $Y<_T\emptyset'$, but $(ω,S)$ is not w.$X$.u.$Y$.c.c. for any $X<_T\emptyset'$ and $Y\not\geq_T\emptyset'$. We also construct a computably categorical structure that is not w.$\emptyset'$.u.c.c., but is w.$X$.u.c.c. for a set $X$ that is $\leq_T$-incomparable with $\emptyset'$.

math.LO↗
arXiv2026

Short proof that Vopěnka's Principle is symmetrically stable

We show that Vopěnka's Principle is stable under symmetric extensions. Recently, de Groot and Woloszyn [1] proved this fact. We found the proof of this theorem unnecessarily complicated. In this short note we prove the same statement. We direct the reader to [3] for an exposition on symmetric extensions.

math.LO↗
arXiv2026

Model Theory of Products of Chains

We show that regarding the model-theoretic properties of distributive lattices isomorphic to finite products of linear orders there is a significant symmetry: if ${\mathbb X}_i$, $i 1$, ${\mathcal T}:=\mathop{\rm Th}\nolimits (\prod _{i 1$ is first order definable.

math.LO↗