Search arXiv⌕ Search

arXiv · 2505.01593

Bilateral base-extension semantics

Abstract

Bilateralism is the position according to which assertion and rejection are conceptually independent speech acts. Logical bilateralism demands that systems of logic provide conditions for assertion and rejection that are not reducible to each other, which often leads to independent definitions of proof rules (for assertion) and dual proof rules, also called refutation rules (for rejection). Since it provides a critical account of what it means for something to be a proof or a refutation, bilateralism is often studied in the context of proof-theoretic semantics, an approach that aims to elucidate both the meaning of proofs (and refutations) and what kinds of semantics can be given if proofs (and refutations) are considered as basic semantic notions. The recent literature on bilateral proof-theoretic semantics has only dealt with the semantics of proofs and refutations, whereas we deal with semantics in terms of proofs and refutations. In this paper we present a bilateral version of base-extension semantics - one of the most widely studied proof-theoretic semantics - by allowing atomic bases to contain both atomic proof rules and atomic refutation rules. The semantics is shown to be sound and complete with respect to the bilateral dual intuitionistic logic 2Int. Structural similarities between atomic proofs and refutations also allow us to define duality notions for atomic rules, deductions and bases, which may then be used for the proof of bilateral semantic harmony results. Aside from enabling embeddings between different fragments of the language, bilateral semantic harmony is shown to be a restatement of the syntactic horizontal inversion principle, whose meaning-conferring character may now be interpreted as the requirement of preservation of harmony notions already present at the core of the semantics by inferences.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Victor Barroso-Nascimento, Maria Osório. 2025-05-02. Bilateral base-extension semantics. https://arxiv.org/abs/2505.01593

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

KEEP EXPLORING

Related papers

Forcing with Symmetric Systems of Models of Two Types

The purpose of this paper is to present a general method for forcing on $ω_2$ and $ω_3$ with finite conditions, while preserving all cardinals and some fragments of $\mathrm{GCH}$. This method is based on the technique of forcing with finite symmetric systems of elementary submodels, and improves earlier versions of this forcing by including models of two types. We will present several applications of the pure side condition forcing and variants thereof, by adding a Kurepa tree on $ω_2$, a club subset of $ω_2$ that avoids infinite sets from the ground model, a function bounding every canonical function below $ω_3$ on a club, and a simplified $(ω_2,1)$-morass.

math.LO↗

On some NIP Fragments of Fields

In this document we study sets of NIP formulas in some theories of fields and valued fields, with a special focus on the sets of quantifier-free and existential formulas. First, we give a new proof of the fact that Separably Closed Valued Fields of any characteristic and any imperfection degree are NIP, and use this result to fill some gaps of a proof of the so-called NIP Transfer Theorem for henselian valued fields of equal characteristic. Second, we prove a variant of a theorem of Johnson: every positive characteristic valued field whose existential formulas are NIP is henselian, and generalize this result for finer sets of existential formulas, like positive existential with a given number of quantifiers, in type-definable fields. Finally, we set the ground for the finer question of transfer of NIP formulas of valued fields with bounded quantifier rank. Namely, we prove that for any henselian equicharacteristic valued field, any formula of quantifier rank at most $n\geq 1$ is NIP if and only if the same is true for the residue field and the value group, provided that the valued field is separably defectless Kaplansky and conditional on a multi-variable generalization of a well known statement about indiscernible sequences of singletons in ac-valued fields.

math.LO↗

Combinatorics of Schur ultrafilters

In this paper, we provide a combinatorial characterization of the elements of Schur ultrafilters on countable commutative groups. Using this characterization, we construct a Schur ultrafilter on $\mathbb Z$ that is not infinitary Schur. Moreover, assuming the Continuum Hypothesis, we establish the existence of Schur P-points in $β(\mathbb Z)$. On the other hand, it is consistent with ZFC that there exist P-points in $β(\mathbb Z)$, but none of them are Schur. Also, we extend the result of Fernández-Bretón, Navarro-Castillo, and Soria-Rojas by showing that no Schur ultrafilter on $\mathbb Z$ is a Q-point.

math.LO↗