Related papers: Nonclassical truth with classical strength. A proo…
This paper considers KLM-style preferential non-monotonic reasoning in the setting of propositional team semantics. We show that team-based propositional logics naturally give rise to cumulative non-monotonic entailment relations. Motivated…
The standard approach to logic in the literature in philosophy and mathematics, which has also been adopted in computer science, is to define a language (the syntax), an appropriate class of models together with an interpretation of…
We develop a classical propositional logic for reasoning about combinatory logic. We define its syntax, axiomatic system and semantics. The syntax and axiomatic system are presented based on classical propositional logic, with typed…
This article presents a computational semantics for classical logic using constructive type theory. Such semantics seems impossible because classical logic allows the Law of Excluded Middle (LEM), not accepted in constructive logic since it…
In logical reasoning, it is often the case that only some of a collection of assumptions are needed to reach a conclusion. A strengthening lemma is an assertion that a given conclusion is independent in this sense of a particular…
Supervaluational fixed-point semantics for truth cannot be axiomatized because of its recursion-theoretic complexity. Johannes Stern (\emph{Supervaluation-Style Truth Without Supervaluations}, Journal of Philosophical Logic, 2018) proposed…
This thesis will be focused on the classical capacity of quantum channels, one of the first areas treated by quantum information theorists. The problem is fairly solved since some years. Nevertheless, this work will give me a reason to…
Implementing a complex concept as an executable model in a strongly typed, purely functional language hits a sweet spot between mere simulation and formal specification. For research and education it is often desirable to enrich the…
One interpretation of how the classical world emerges from an underlying quantum reality involves the build-up of certain robust entanglements between particles due to scattering events [Science Vol.301 p.1081]. This is an appealing view…
We consider extensions of the language of Peano arithmetic by transfinitely iterated truth definitions satisfying uniform Tarskian biconditionals. Without further axioms, such theories are known to be conservative extensions of the original…
Fine's influential Canonicity Theorem states that if a modal logic is determined by a first-order definable class of Kripke frames, then it is valid in its canonical frames. This article reviews the background and context of this result,…
Agentic theorem provers often introduce intermediate lemmas, proof sketches, or subgoal decompositions before returning to tactic-level search. This can look like an expensive detour: if proving lemmas is itself hard, why should a learned…
It is well-known that a finite axiomatization of Zermelo-Fraenkel set theory (ZF) is not possible in the same first-order language. In this note we show that a finite axiomatization is possible if we extent the language of ZF with the new…
Belnap-Dunn logic, also knows as the logic of First-Degree Entailment, is a logic that can serve as the underlying logic of theories that are inconsistent or incomplete. For various reasons, different expansions of Belnap-Dunn logic with…
A dichotomy result of Sevenster (2014) completely classified the quantifier prefixes of regular Independence-Friendly (IF) logic according to the patterns of quantifier dependence they contain. On one hand, prefixes that contain "Henkin" or…
Building compositional explanations requires models to combine two or more facts that, together, describe why the answer to a question is correct. Typically, these "multi-hop" explanations are evaluated relative to one (or a small number…
On the ground of a general theorem concerning the admissibility of the structural rules in sequent calculi with additional atomic rules, we develop a proof theoretic analysis for several extensions of the ${\bf G3[mic]}$ sequent calculi…
This paper presents an abstract, mathematical formulation of classical propositional logic. It proceeds layer by layer: (1) abstract, syntax-free propositions; (2) abstract, syntax-free contraction-weakening proofs; (3) distribution; (4)…
The sequential form of a statement $\forall\xi(B(\xi) \rightarrow \exists\zeta A(\xi,\zeta))$ is the statement $\forall\xi(\forall n B(\xi_n) \rightarrow \exists\zeta \forall n A(\xi_n,\zeta_n))$. There are many classically true statements…
Between the two dominant schools of thought in statistics, namely, Bayesian and classical/frequentist, a main difference is that the former is grounded in the mathematically rigorous theory of probability while the latter is not. In this…