We investigate the relationship between base-extension semantics, Beth semantics, and Prawitz's ecumenical logic. We first present a base-extension semantics for the propositional fragment of Prawitz's system and prove that it is sound and complete. The semantics interprets intuitionistic and classical operators directly within a common proof-theoretic framework, without reducing the classical operators to their intuitionistic counterparts by means of a translation. We then analyse the effect of incorporating Beth-style clauses into base-extension semantics. When arbitrary bases are admitted and ⊥ is governed by atomic explosion, these clauses trivialise. By contrast, when ⊥ is treated as a basic sentence and attention is restricted to consistent bases, the Beth-style clauses for atoms and disjunction characterise, respectively, classical atoms and classical disjunction in Prawitz's system. We also obtain equivalent, path-independent formulations of the classical clauses for atoms, disjunction, and implication. These results reveal that the consistency constraint is not merely a technical restriction: within base-extension semantics, it transforms clauses originally associated with intuitionistic semantics into semantic characterisations of classical operators.
Introduction
The relatively young discipline of proof-theoretic semantics (PtS) provided a fresh breath of air into the semantic study of intuitionistic logic [47]. Grounded in inferentialist interpretations of constructivism that regard proofs as semantic ingredients of meaning [9], PtS provides new semantic frameworks in which the core semantic values are defined in terms of proof-theoretic structures corresponding to constructive proofs of propositions. Aside from making explicit the relationship between semantics and proofs, PtS has the additional benefit of allowing use of proof-theoretic instruments for the proof of semantic results.
An important instance of this approach is base-extension semantics (BeS) [45], in which validity is defined relative to systems of rules over basic sentences and their extensions. The resulting semantics exhibits a clear structural affinity with Kripke semantics: bases may be regarded as information states, base extension behaves like an accessibility relation, and the clause for implication quantifies over all extensions of the current base [25, 39]. This affinity is more than suggestive. Pym, Ritter, and Robinson [44] analyse Sandqvist’s semantics by means of presheaf and sheaf constructions, clarifying its relationship with intuitionistic Kripke models and, in particular, the distinctive behaviour of disjunction in BeS. Correspondences between base-extension and Kripke semantics have also been developed for several classical and intuitionistic modal logics by Eckhardt and Pym [19] and by Buzoku and Pym [11].
The relationship between BeS and traditional model-theoretic semantics is nevertheless far from exhausted. In particular, its connection with Beth semantics [6] remains largely unexplored. This is especially intriguing because the two approaches treat disjunction in formally similar ways [55]. One might therefore expect Beth’s clauses to provide an alternative route to the intuitionistic operators of BeS. However, what happens is almost the opposite! The behaviour of the clauses depends of the treatment of absurdity, but in neither case we have intuitionistic logic.
When Beth-style clauses are transplanted into the usual base-extension setting, in which ⊥ is understood through atomic explosion, the resulting clauses trivialise: the presence of a greatest base, containing all atomic rules, forces the relevant conditions to hold indiscriminately. The picture changes completely when ⊥ is itself treated as a basic sentence and the semantics is restricted to consistent bases. Under this constraint, Beth-style clauses cease to be trivial and instead characterise classical operators. Quite surprisingly, this brings Beth semantics into contact with logical ecumenism, which is an approach to logic that aims at providing frameworks allowing rival logics to peacefully coexist [4]. In this setting, Beth’s clause for disjunction provides semantics to the classical disjunction of Prawitz’s ecumenical system[43].
The version of BeS developed in [4] for Barroso-Nascimento’s ecumenical system [2] already points in this direction. There, intuitionistic validity is grounded in the traditional understanding of proofs as constructions, whereas the consistency constraint gives rise to a genuinely classical notion of proof, echoing Hilbert’s association between truth and proofs of consistency [15, 29].
The present paper develops this connection for Prawitz’s ecumenical logic. Since by using Beth’s semantic definitions in this setting we obtain semantic characterisations of Prawitz’s classical connectives, such clauses, originally devised to provide a genuinely intuitionistic definition of proof, can also be used to provide a genuinely classical definition of proof. Moreover, analogously to what happens in [4], the metalanguage of the semantics has to be ecumenical, but classical reasoning principles (which now include set-theoretic as well as logical reasoning) are required only to establish properties of classical connectives. Thus, the coexistence between classical and intuitionistic reasoning is reflected not only in the object language, but also in the methods used to study its semantics.
This gives rise to the following motto:
Overview
Three strands come together in the results of this paper: Prawitz’s logical ecumenism, base-extension semantics, and Beth semantics. Each approaches the boundary between classical and intuitionistic reasoning from a different direction: Ecumenism places their operators within a common language; base-extension semantics gives meaning in terms of inferences and their possible extensions; and Beth semantics follows what becomes established along every possible path. In this section, we recall the aspects of these three approaches that will allow them to meet in the technical development that follows.
Logical ecumenism
Logical ecumenism is a philosophical and proof-theoretic framework introduced by Peter Krauss [32, 31], Dag Prawitz [43] and Gilles Dowek [16, 7, 26, 8, 27], aimed at harmonising opposing logical systems, most notably intuitionistic and classical logic. Rather than viewing constructivism and classicism as mutually exclusive concepts, ecumenism posits that both can peacefully coexist within a single, unified language. Under this view, logical disagreement is not an intractable dispute over the nature of truth, but rather a distinction in the logical constants being expressed.
At its structural core, an ecumenical system achieves such a harmony by sharing a common set of foundational connectives, while bifurcating others into explicitly variants. For example, an intuitionistic implication demands a constructive method to transform proofs, whereas its classical counterpart accommodates non-constructive principles like double negation elimination. This setup allows classicists and intuitionists to reason in the same workspace while precisely tracking where non-constructive assumptions are deployed.
This is actually the core behind Prawitz’s ecumenism [43], where classicists and intuitionists share what are called neutral connectives: ∧, ⊥, ∀ for conjunction, falsity and universal quantification. Thinking of the proof-theoretical nature of these connectives, they all share the same inference rules in, e.g., Gentzen’s LK and LJ sequent systems [22]. On the other hand, implication, disjunction and the existential quantifier have a quite different behavior in these systems, and this is reflected in Prawitz ecumenism, where there are classical and intuitionistic versions of them. Prawitz’s claim is that they are not, in fact, the same connectives.
Negation deserves separate discussion. In both classical and intuitionistic logic, proving the negation of a sentence A typically amounts to deriving a contradiction from the assumption A. As Prawitz puts it:
There is no other direct way of getting a ground for asserting ¬A classically, although the classical use of negation differs from the intuitionistic.
This naturally raises the question of how the classical use of negation can be captured proof-theoretically. As noted in [43], introducing separate classical and intuitionistic negation constants equipped with their expected inference rules would cause the two connectives to collapse into one, a phenomenon first observed by Popper in [41]. While this already provides strong evidence that negation is, in fact, a neutral connective as defended by Prawitz, in this work we present an even stronger proof by showing that classical and intuitionistic negation also collapse at the semantic level (see § 3).
Prawitz’s formulation of ecumenism is particularly well suited to the present work because it internalises the classical/intuitionistic coexistence in a single deductive system. This makes it a natural testing ground for an inferentialist semantics: If the distinction between its operators is fundamentally a distinction between rules, then their semantic interpretation should reflect those rules directly.
Base-extension Semantics
Whereas model-theoretic semantics [30] explains the meaning of logical expressions through their interpretation in set-theoretic structures, with Tarski’s definition of truth as the paradigmatic example [51], Proof-theoretic semantics (PtS) [42, 46, 47] takes proofs and inferences as fundamental. Its philosophical basis is inferentialism[9]: the meaning of a logical expression is determined by the inferential rules governing it. Logical constants are therefore characterised not by the conditions under which they are true in a model, but by the role they play in reasoning.
PtS has recently attracted considerable attention, see, e.g., [50, 24, 1, 12]. By grounding validity in derivability, PtS makes it possible to employ the rich machinery of proof theory in giving meaning to logical operators.
BeS is a strand of PtS in which proof-theoretic validity is defined relative to a specified collection of inference rules, called a base, governing the basic formulas of the language [45]. Such bases provide the underlying proof-theoretic environment from which the semantic behaviour of complex formulas is determined. These basic formulas are typically atomic propositions, whose meaning is determined by their inferential role within the base.
To illustrate the idea, suppose that one does not know the meaning of the sentence
“Giant squids live in the aphotic zone.”
If, however, we are given the inference rules
Giant squids live in the oceanGiant squids live in the aphotic zoneGiant squids live in areas with little or no sunlightGiant squids live in the aphotic zone
Giant squids live in the aphotic zoneGiant squids live in the oceanGiant squids live in areas with little or no sunlight
then the inferential role of “aphotic zone” tells us that, in this setting, it corresponds to a part of the ocean with little or no sunlight.
Bases do more than specify the inferential roles of basic formulas: they themselves constitute inference systems in which such formulas can be derived. For example, let r, w, u, m, d represent, respectively, the sentences “It’s raining”, “I might get wet”, “I have an umbrella”, “I bring the umbrella with me”, and “I will stay dry”, and consider a base S containing the following rules
[r]wrmwu⋮dm
Then, within S, we can derive that “I will stay dry” from “I have an umbrella”
w[r]dmwu
The derivation above takes place entirely within the base S. A central feature of BeS, however, is that we do not consider bases in isolation. A base S is an extension of S, written S′⊇S, if it contains all the rules of S, possibly together with additional ones. Intuitively, extending a base amounts to enriching our inferential resources: anything derivable in S remains derivable in S′, but the additional rules may enable new derivations.
For example, consider the extension S′⊇S by adding the rule
ur
expressing, for example, that whenever it rains I have an umbrella available. In the extended base S′, from r we can now derive both w and u, and hence m
mwrur
The passage from S to S′ therefore represents an increase in inferential information, rather than a change in the meaning of rules already present in S.
This notion of extension plays a fundamental role in BeS. Semantic support is often required to be stable under extensions of a base: what is supported given certain inferential resources must remain supported when those resources are enriched. Moreover, the semantic clauses for some logical operators explicitly quantify over extensions of the current base. In this sense, base extensions play a role analogous to accessible future states in Kripke semantics, although here the underlying structure is proof-theoretic: what grows is not a state of information specified model-theoretically, but the collection of available inference rules.
Sandqvist [45] gave a sound and complete formulation of BeS for intuitionistic propositional logic. There, the notion of consequence in BeS is given by an inductively defined semantic judgment, called support, whose base case is determined by provability in a base. Thus, for any base S, the support of an atomic formula p is defined by
⊩Spiffp is provable in S.
The clauses for complex formulas are then defined inductively. Conjunction, for example, behaves much as it does in Kripke semantics:
⊩SA∧Biff⊩SA and ⊩SB.
Beyond this point, however, the similarity with Kripke semantics begins to fade. In particular, ⊥ is often understood as absurdity, following its second-order characterisation instantiated over atoms (as in the system Fat [20]):
⊩S⊥iff⊩Sp for every atom p.
Simply requiring ⊥ to be unsupported, as one might expect by analogy with Kripke semantics, leads to serious problems. In particular, it allows one to establish ⊩S¬¬p for every atom p[39]. Perhaps surprisingly, this is not the case if we include ⊥ in bases but require ⊬S⊥ to hold for all bases. As demonstrated in [4], by doing this and using the other semantic clauses of standard BeS we obtain a semantics for intuitionistic logic.
As we shall show, BeS is particularly well suited to the ecumenical setting: it allows the interaction between neutral, intuitionistic, and classical operators to be captured directly, without appealing to a translation into one of the component logics.
BeS and Beth: Constructivism and Consistency
The impact of definitions of ⊥ in intuitionistic logic and completeness proofs has a very rich history. Beth’s original proof of completeness for his semantics contained an important flaw directly related to the possibility of models being inconsistent [53 pg. 8]. A result due to Gödel and Kreisel shows that this is part of a more general phenomenon, as any completeness proof for semantics having a definition of ⊥ in terms of unsatisfiability has to validate Markov’s principle at the metalinguistic level [36, 33]. On the other hand, Veldman [54] and de Swart [14] provided intuitionistic completeness proofs for Kripke and Beth first-order intuitionistic semantics by defining ⊥ in terms of explosion. Sandqvist’s [45] and Gheorghiu’s [23] completeness proofs follow along the same lines.
Beth semantics is defined over ordered frames F=⟨W,≤⟩, with paths represented by maximal chains. Beth’s approach yields semantics for different logics depending on the class of frames used [13]. Historically, Beth gave particular importance to spreads and fans: a spread is a tree in which every node has a successor, and a fan is a finitely branching spread [52 p. 679], [6]. This choice reflects the connection between Beth’s frames and Brouwer’s free-choice sequences, through which mathematical activity is understood as a process unfolding through successive choices [13 p. 21]. It also illustrates how both the selection of frames and their intended pre-theoretic interpretation shape the relationship between a semantics and constructive mathematics.
This becomes particularly important for BeS once we point out that similar readings are applicable to the concepts of bases and extensions. Given the standard reading of bases as collections of accepted inferences, the extension relation can be visualised as standing for a process of expansion of a knowledge base [48]. If all bases are allowed in our semantics, we are considering all possible extension process, and if we only allow consistent bases, we are only considering extensions preserving consistency.
Despite this conceptual similarity, structural differences makes transplantation of Beth’s interpretation to BeS untenable. This is so since the set of all bases can be characterised as the powerset of the set of all rules [49] and, since there are countably infinitely many rules, there are uncountably many bases. This entirely precludes the establishment of any meaningful conceptual relationship between BeS and choice sequences: while Beth semantics, when defined over fans, is capable of providing infinitary definition with strong, finitary roots, BeS quantifies over an uncountable set and characterises its extension processes in terms of the continuum1. This makes it so that the set-theoretic metalinguistic structure employed in BeS exhibits strong classical features.
Traditional definitions of Beth semantics use a definition of atomic valuation different from that of Kripke semantics [13, 52], although it is also possible to define Beth semantics using Kripke valuations [37]. The basic difference between both is that Beth valuations allows the value of an atom at a point to affect its value in antecessors of that point, whereas Kripke valuations only allows a point to affect its successors. The formal definitions are as follows.
Definition 2.1. Given any ordered frame F=⟨W,≤⟩, a function b:W↦P(At) is a Beth valuation if, for all atoms p, if for all maximal chains α such that w∈α there is some w′∈α such that p∈b(w′), then p∈b(w).
Definition 2.2. Given any ordered frame F=⟨W,≤⟩, a function k:W↦P(At) is a Kripke valuation if p∈k(w) and w≤w′ implies p∈k(w′).
Intuitively, Beth and Kripke valuations establish which atomic facts hold at each point w of the frame. The condition imposed on Beth valuations requires that, whenever an atomic fact is eventually established at some point w′ in any maximal chains passing through w, it is already be established at w. Although the requirement is only stated for atoms, it is possible to prove that the property extends to arbitrary formulas [13 pg. 25]. When combined with fans, Beth valuations can intuitively be read as fixing that everything inevitably knowable in a finite amount of time can already be considered true. As such, Beth semantics seems to be a particularly good fit for Michael Dummett’s constructive concept of truth [18], in which a statement is considered true (although possibly not yet provable or assertible) whenever some procedure leading to a construction of its object is available, even if the construction itself has not been obtained, and regardless of our knowledge of the fact that the procedure will lead to this construction [3 pg. 31]. It is also worthy of notice that Beth valuations are monotonic, meaning that every Beth valuation is also a Kripke valuation [34], but not all Kripke valuations constitute Beth valuations.
Beth’s semantic clauses are then defined by using a doubly indexed relation ⊩wF to define validity in w∈W of a frame F=⟨W,≤⟩, then defining ⊩F in terms of ⊩wF and then ⊩ in terms of ⊩F. For our purposes it suffices to consider the definitions using ⊩wF, as we only compare semantic clause for operators. The clauses for conjunction, implication and entailment correspond to those of Kripke semantics (and BeS), but his clauses for atomic validity and disjunction are as follows:
⊩wFp iff p∈b(w), for atomic p;
⊩wFA∨B iff for every path α with w∈α there is some w′∈α such that either ⊩w′FA or ⊩w′FB;
Although the definition of atomic support in BeS seems to be closer to Kripke’s definition of atomic validity, Beth’s definition of disjunction is remarkably similar to that of BeS. In particular, both allow a disjunction A∨B to be semantically valid in a point w (or base S) even when neither A nor B are valid in that particular point. If we change Beth’s clause to one in which A∨B is valid in w iff either A or B is valid in w, we get the intuitionistic Kripke semantic, but if the same change is done in BeS this leads to incompleteness w.r.t. intuitionistic logic [39]. Since the semantic clauses of BeS can be interpreted as definitions over the frame containing all bases, ordered by set-theoretic inclusion [25, 39], this result can be interpreted as a consequence of the fact that the frames use in BeS are much more restrictive than those used in Beth and Kripke semantics.
It is important to note that, unlike Kripke semantics, Beth semantics is highly frame-sensitive [13]. To provide an example, while the set of finitary Kripke models is sound and complete w.r.t. intuitionistic logic, every finite Beth model is classical [13 pg. 42]. The results we will prove are intimately connected to the frame structures implicitly defined by BeS and the behaviour they induce in Beth clauses. Since standard BeS with ⊥ defined explosively and BeS with the consistency constraint implicitly define different frames, pairing Beth clauses with them has different effects. In short, the connections we will show between Beth semantics and standard BeS hold Since the set of all bases, when ordered by the set-inclusion relation, has a greatest element (the set of all rules), while the set of all consistent bases, despite not having a greatest element, contains maximal consistent bases as maximal elements in all its maximal chains.
BeS for Prawitz’s ecumenical system
In this work, we adopt Sandqvist’s terminology and adapt the framework to the ecumenical setting, following the developments in [4, 5]. In particular, we treat ⊥ itself as a basic formula while restricting attention to consistent bases.
The propositional base language is assumed to have the set At consisting of a countable infinite set of atomic propositions {p1,p2,…}, together with the unit ⊥. The elements of At will be called basic sentences. We use, as does Sandqvist, systems containing natural deduction rules over basic sentences for the semantical analysis, and we allow inference rules to discharge sets of basic hypotheses. Sets used in the definition of the derivability relation and semantic consequence are always assumed to be finite. Unlike Sandqvist, however, we allow the logical constant ⊥ to be manipulated by the rules.
In what follows, we will adopt the following notation: capital Greek letters with the subscript ‘At’ (ΓAt,ΔAt) denote finite sets of basic sentences; capital letters (A,B) denote formulas; capital Greek letters without the subscript ‘At’ (Γ,Δ) denote sets of formulas; commas between sets denote set union.
Definition 3.1 (Base). An atomic system (a.k.a. base) S is a (possibly empty) set of atomic rules of the form
[ΔAt1]⋮p1⋯p[ΔAtn]⋮pn
where pj,p∈At and ΔAtj are (possibly empty) finite sets of basic sentences. The sequence ⟨p1,…,pn⟩ of premises of the rule can be empty – in this case the rule is called an atomic axiom. Labels will sometimes be written as the superscript of ΔAtj and to the right of a rule to denote that ΔAtj was discharged at that rule application.
Definition 3.2 (Extension). An atomic system S′ is an extension of an atomic system S (written S′⊇S), if S′ results from adding a (possibly empty) set of atomic rules to S.
Definition 3.3 (Deducibility). The deducibility relation ⊢S coincides with the usual notion in the system of natural deduction consisting of just the rules in S, that is, p1,…,pn⊢Sp iff there exists a deduction with the rules of S whose conclusion is p and whose set of undischarged premises is a subset of {p1,…,pn}.
Note that, following this definition, if p∈{p1,…,pn} then p1,…,pn⊢Sp holds regardless of S, as a single occurrence of the assumption p already counts as a ruleless deduction of p from p.
Definition 3.4 (Consistency). An atomic system S is called consistent if ⊬S⊥.
All the bases considered in this section are consistent. In § 4 we will discuss an alternative semantics where this restriction can be dropped.
Prawitz’s ecumenical propositional base language L[43] is described as follows. We will use a subscript c for the classical meaning and i for the intuitionistic one, dropping such subscripts when formulas/connectives can have either meaning. ⊥∈L and, if p∈At−{⊥}, then pc,pi∈L2.2 The neutral logical connectives {¬,∧} are shared between the classical and intuitionistic fragments, while {→c,∨c} and {→i,∨i} are restricted to classical and intuitionistic interpretations, respectively.
Prawitz’s natural deduction system for the propositional fragment of ecumenical logic, denoted by NEp, is presented in Figure 1. We write Γ⊢NEpA when there is a NEp-deduction with conclusion A whose undischarged assumptions form a subset of Γ.
Figure 1. Ecumenical natural deduction system NEp.
An ecumenical version of BeS is given by the definition below. As usual, we start by giving semantic conditions for basic sentences in atomic systems, expanding them through semantic clauses, having as a starting point Sandqvist’s semantics for intuitionistic logic [45].
References
[1]Sara Ayhan. Contradictions without negation and a proof-theoretic, bilaterialist account of connexeive logics. Rev. Symb. Log., 19(2):375–402, 2026.DOI
[3]Victor Barroso-Nascimento. Foundational Studies in Proof-theoretic Semantics. PhD thesis, Rio de Janeiro State University, 2024. Centro de Ciências Sociais: Instituto de Filosofia e Ciências Humanas.
[4]Victor Barroso-Nascimento, Luiz Carlos Pereira, and Elaine Pimentel. An ecumenical view of proof-theoretic semantics. Synthese, 206(4):1–39, 2025.
[5]Victor Barroso-Nascimento, Ekaterina Piotrovskaya, and Elaine Pimentel. A sequent calculus perspective on base-extension semantics. In Gian Luca Pozzato and Tarmo Uustalu, editors, Automated Reasoning with Analytic Tableaux and Related Methods - 34th International Conference, TABLEAUX 2025, Reykjavik, Iceland, September 27-29, 2025, Proceedings, volume 15980 of Lecture Notes in Computer Science, pages 3–21. Springer, 2025.
[6]Evert Willem Beth. Semantic construction of intuitionistic logic. Koninklijke Nederlandse Akad. von Wetenschappen, 19(11):357–388, 1956.
[7]Frédéric Blanqui, Gilles Dowek, Émilie Grienbenger, Gabriel Hondet, and François Thiré. Some axioms for mathematics. In Naoki Kobayashi, editor, 6th International Conference on Formal Structures for Computation and Deduction, FSCD 2021, July 17-24, 2021, Buenos Aires, Argentina (Virtual Conference), volume 195 of LIPIcs, pages 20:1–20:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.
[8]Frédéric Blanqui, Gilles Dowek, Émilie Grienbenger, Gabriel Hondet, and François Thiré. A modular construction of type theories. Log. Methods Comput. Sci., 19(1), 2023.DOI
[9]Robert Brandom. Articulating Reasons: An Introduction to Inferentialism. Harvard University Press, 2000.
[10]Luitzen Egbertus Jan Brouwer. Brouwer’s Cambridge Lectures on Intuitionism. Cambridge University Press, New York, 1981.
[11]Yll Buzoku and David J. Pym. Base-extension semantics for intuitionistic modal logics (extended abstract). In Gian Luca Pozzato and Tarmo Uustalu, editors, Automated Reasoning with Analytic Tableaux and Related Methods - 34th International Conference, TABLEAUX 2025, Reykjavik, Iceland, September 27-29, 2025, Proceedings, volume 15980 of Lecture Notes in Computer Science, pages 318–334. Springer, 2025.DOI
[12]Antonio Piccolomini d’Aragona and Dag Prawitz. Some variants of proof-theoretic semantics and their relations with intuitionistic logic. Topoi, 45:663–674, 2026.DOI
[13]Bram de Beer. Frame Properties of Beth Models. PhD thesis, Utrecht University, 2012.
[14]Harrie de Swart. Another intuitionistic completeness proof. The Journal of Symbolic Logic, 41(3):644–662, 1976.DOI
[15]Fiona T. Doherty. Hilbert on consistency as a guide to mathematical reality. Logique et Analyse, (237):107–128, 2017.
[16]Gilles Dowek. On the definition of the classical connectives and quantifiers. Why is this a Proof?, Festschrift for Luiz Carlos Pereira, 27:228–238, 2016.arxiv.org/abs/1601.01782
[17]Michael Dummett. Elements of Intuitionism. Oxford University Press, New York, 1977.
[18]Michael Dummett. Truth from the constructive standpoint. Theoria, 64(2-3):122–138, 1998.DOI
[19]Timo Eckhardt and David J. Pym. Base-extension semantics for S5 modal logic. Log. J. IGPL, 33(4), 2025.arxiv.org/abs/2403.19431
[20]Fernando Ferreira and Gilda Ferreira. Atomic polymorphism. J. Symb. Log., 78(1):260–274, 2013.DOI
[21]Gilda Ferreira, Paulo Oliva, and Clarence Lewis Protin. On the various translations between classical, intuitionistic and linear logic, 2025. Available at: https://arxiv.org/abs/2409.02249.
[22]Gerhard Gentzen. The Collected Papers of Gerhard Gentzen. Amsterdam: North-Holland Pub. Co., 1969.
[23]Alexander V. Gheorghiu. Proof-theoretic semantics for first-order logic. Logic Journal of the IGPL, 33(5):jzaf062, 12 2025.arxiv.org/abs/2410.11751
[24]Alexander V. Gheorghiu, Tao Gu, and David J. Pym. Proof-theoretic semantics for intuitionistic multiplicative linear logic. Stud Logica, 114(2):451–511, 2026.
[25]Warren Goldfarb. On Dummett’s “proof-theoretic justifications of logical laws”. In Peter Schroeder-Heister and Thomas Piecha, editors, Advances in Proof-Theoretic Semantics, pages 195–210. Springer Verlag, 2015.DOI
[26]Émilie Grienberger. Expressing ecumenical systems in the λΠ-calculus modulo theory. In Delia Kesner and Pierre-Marie Pédrot, editors, 28th International Conference on Types for Proofs and Programs, TYPES 2022, L2SN, University of Nantes, France, June 20-25, 2022, volume 269 of LIPIcs, pages 4:1–4:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.
[27]Émilie Grienenberger. Combining computational theories. (Combinaisons de théories calculatoires). PhD thesis, University of Paris-Saclay, France, 2025.DOI
[28]Arend Heyting. Intuitionism: An Introduction. North-Holland Pub. Co., Amsterdam,, 1956.
[29]David Hilbert, Mary Winston Newsom, Felix E. Browder, Donald A. Martin, G. Kreisel, and Martin Davis. Mathematical problems. lecture delivered before the international congress of mathematicians at paris in 1900. Journal of Symbolic Logic, 44(1):116–119, 1979.
[30]Wilfrid Hodges. Model Theory. In Edward N. Zalta and Uri Nodelman, editors, The Stanford Encyclopedia of Philosophy. Metaphysics Research Lab, Stanford University, Fall 2023 edition, 2023.
[31]Peter Krauss. Application to basic algebraic number theory. Draft, 1992.
[32]Peter Krauss. A constructive refinement of classical logic. Draft, 1992.
[33]Georg Kreisel. On weak completeness of intuitionistic predicate logic. The Journal of Symbolic Logic, 27(2):139–158, 1962.DOI
[34]Saul A. Kripke. Semantical analysis of intuitionistic logic i. In Studies in Logic and the Foundations of Mathematics, volume 40, pages 92–130. Elsevier, 1965.DOI
[35]David C. Makinson. On an inferential semantics for classical logic. Logic Journal of the IGPL, 22(1):147–154, 2014.DOI
[36]David C. McCarty. On Theorems of Gödel and Kreisel: Completeness and Markov’s Principle. Notre Dame Journal of Formal Logic, 35(1):99 – 107, 1994.DOI
[37]Joan Moschovakis. Intuitionistic Logic. In Edward N. Zalta and Uri Nodelman, editors, The Stanford Encyclopedia of Philosophy. Metaphysics Research Lab, Stanford University, Summer 2024 edition, 2024.
[38]Luiz Carlos Pereira and Ricardo Oscar Rodriguez. Normalization, soundness and completeness for the propositional fragment of prawitz? ecumenical system. Revista Portuguesa de Filosofia, 73(3-4):1153–1168, 2017.DOI
[39]Thomas Piecha, Wagner de Campos Sanz, and Peter Schroeder-Heister. Failure of completeness in proof-theoretic semantics. Journal of Philosophical Logic, 44(3):321–335, 2015.DOI
[40]Elaine Pimentel, Luiz Carlos Pereira, and Valeria de Paiva. An ecumenical notion of entailment. Synthese, 198(22-S):5391–5413, 2021.
[41]Karl R. Popper. On the theory of deduction, part ii: The definitions of classical and intuitionist negation. Proceedings of the Section of Sciences, 51:322–331, 1948.
[42]Dag Prawitz. Meaning approached via proofs. Synthese, 148:507–524, 2006.
[43]Dag Prawitz. Classical versus intuitionistic logic. In Bruno Lopes Edward Hermann Haeusler, Wagner de Campos Sanz, editor, Why is this a Proof? Festschrift for Luiz Carlos Pereira, volume 27, pages 15–32. College Publications, 2016.
[44]David J. Pym, Elke Ritter, and Edmund Robinson. Categorical proof-theoretic semantics. Stud Logica, 113(1):125–162, 2025.arxiv.org/abs/2302.09031
[45]Tor Sandqvist. Base-extension semantics for intuitionistic sentential logic. Logic Journal of the IGPL, 23(5):719–731, 2015.DOI
[46]Peter Schroeder-Heister. Uniform proof-theoretic semantics for logical constants (abstract). Journal of Symbolic Logic, 56:1142, 1991.
[47]Peter Schroeder-Heister. Proof-Theoretic Semantics. In Edward N. Zalta and Uri Nodelman, editors, The Stanford Encyclopedia of Philosophy. Metaphysics Research Lab, Stanford University, Winter 2022 edition, 2022.
[48]Peter Schroeder-Heister and Thomas Piecha. Atomic systems in proof-theoretic semantics: Two approaches. In Ángel Nepomuceno Fernández, Olga Pombo Martins, and Juan Redmond, editors, Epistemology, Knowledge and the Impact of Interaction, pages 47–62. Springer Verlag, 2016.
[49]Will Stafford and Victor Nascimento. Following all the rules: Intuitionistic completeness for generalized proof-theoretic validity. Analysis, 83(3):507–516, 07 2023.DOI
[50]Will Stafford, Thomas Piecha, and Peter Schroeder-Heister. Logics of proof-theoretic validity. Topoi, 45(2):643–661, 2025.DOI
[51]Alfred Tarski. The semantic conception of truth: and the foundations of semantics. Philosophy and Phenomenological Research, 4(3):341–376, 1944.
[52]Anne S. Troelstra and Dirk Van Dalen. Constructivism in Mathematics: An Introduction, volume 2. North Holland, Amsterdam, 1988.
[53]Anne S. Troelstra and Paul van Ulsen. The discovery of E. W. Beth’s semantics for intuitionistic logic. In Jelle Gerbrandy, Maarten Marx, Maarten de Rijke, and Yde Venema, editors, Essays dedicated to Johan van Benthem on the occasion of his 50th birthday. Amsterdam University Press, 1999.
[54]Wim Veldman. An intuitionistic completeness theorem for intuitionistic predicate logic. The Journal of Symbolic Logic, 41(1):159–166, 1976.
[55]Joaquim T. Waddington, Alexander V. Gheorghiu, and David J. Pym. Inferentialist game semantics (extended abstract). CoRR, abs/2607.13855, 2026.arxiv.org/abs/2607.13855