This paper validates and verifies I-bS by applying it to all connective rule pairs that can be formulated in two-dimensional sequent calculi using at most two premiss sequents and at most two active formulae, and finds that intuitionistic negation, disjunction and implication each capture half of the meaning of their classical counterparts.
Abstract
Inference-behaviour semantics (I-bS) is a new approach to proof-theoretic semantics, grounded in two inferentialist principles: (1) the use of an expression in reasoning determines its meaning, and (2) a connective is defined by its operational rules. I-bS operationalises these ideas by measuring the syntactic use of a connective in the proof of its definability, against a substructurally minimal derivability relation. I-bS thereby gives the meaning of a connective in terms of its semantic clause, i.e. minimal substructural rule pair. This paper validates and verifies I-bS by applying it to all $10,816$ connective rule pairs that can be formulated in two-dimensional sequent calculi using at most two premiss sequents and at most two active formulae. As a result, we find semantic clauses for exactly $21$ meaningful connectives, namely bottom, top, two negations (intuitionistic and dual-intuitionistic), group and lattice conjunction, disjunction and implication, as well as their converses and inverses. We use these results to precisely map the semantic interrelations among the connectives, across linear, classical, intuitionistic, dual-intuitionistic, minimal, and lattice logic. Most notably, we find that intuitionistic negation, disjunction and implication each capture half of the meaning of their classical counterparts.
It is proved that $\mathbf{B}_{ti}$ is the multiple-succedent sequent calculus read upside down, that $\mathbf{G}_{ti}$ admits the structural rules, and that $\mathbf{B}_{ti}$ is sound and complete for Kripke semantics, with the finite model property and a block-theoretic proof of the disjunction property.
The shallow embedding of higher-order modal logic in classical higher-order logic, used in Benzm\"uller and Scott's Notes on G\"odel's and Scott's variants of the ontological argument, reaches beyond the modal object language: its quantifiers range over domains containing the nominals and satisfaction operators of hybr...
A uniform proof-theoretic framework for non-contingency logic over a broad class of frame conditions is developed based on generalized path conditions (GPCs), a grammar-theoretic formalism that uniformly captures many standard modal frame properties.
In this paper, by a de re modal logic of terms, we mean a set of tautologies determined by a given semantics. We present a comprehensive study of several such semantics. First, we analyse semantics with a natural interpretation of de re modal propositions. We use the Johnson–Thomason models, but reject their four a...
A. Pietruszczak· Studia Logica: An Internatio...· 0 citations
NAFBench is introduced, a procedural generator of solver-certified instances spanning four semantic viewpoints: SLDNF, well-founded semantics (WFS), and credulous and skeptical reasoning under stable-model semantics, which studies which reading of negation large language models adopt by default and whether they can ove...
Qiming Bao, Agnieszka Mensfelt, Michael J. Witbrock et al.· arXiv.org· 0 citations
This method provides a new approach to propositionalizing some FOL sentences over infinite domains and testing the validity of inferences composed of them, and it may be applied to formal reasoning in mathematics and physics.
Pei-Feng Li· Communications in Humanities...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.