The following pages link to Pesca (Q25578):
Displayed 50 items.
- Incomplete symbols -- definite descriptions revisited (Q253123) (← links)
- Glivenko sequent classes in the light of structural proof theory (Q283115) (← links)
- On all strong Kleene generalizations of classical logic (Q295922) (← links)
- Analytic rules for mereology (Q300557) (← links)
- Proof theory for reasoning with Euler diagrams: a logic translation and normalization (Q361868) (← links)
- A proof-search procedure for intuitionistic propositional logic (Q377482) (← links)
- Does the deduction theorem fail for modal logic? (Q383061) (← links)
- Socratic trees (Q383562) (← links)
- Eliminability of cut in hypersequent calculi for some modal logics of linear frames (Q477584) (← links)
- On harmony and permuting conversions (Q518743) (← links)
- General-elimination stability (Q526738) (← links)
- Yet another bijection between sequent calculus and natural deduction (Q530853) (← links)
- General-elimination harmony and the meaning of the logical constants (Q600850) (← links)
- Implications-as-rules vs. implications-as-links: an alternative implication-left schema for the sequent calculus (Q626494) (← links)
- Hypersequent calculi for intuitionistic logic with classical atoms (Q636282) (← links)
- Combinatorial analysis of proofs in projective and affine geometry (Q638479) (← links)
- Reasoning about collectively accepted group beliefs (Q652734) (← links)
- Proof analysis in intermediate logics (Q661286) (← links)
- A framework for proof systems (Q707742) (← links)
- Corrected upper bounds for free-cut elimination (Q719283) (← links)
- Principles for object-linguistic consequence: from logical to irreflexive (Q722029) (← links)
- The \(\lambda \)-calculus and the unity of structural proof theory (Q733755) (← links)
- The bounded proof property via step algebras and step frames (Q741087) (← links)
- Proof theory of Nelson's paraconsistent logic: a uniform perspective (Q764309) (← links)
- Proof analysis in modal logic (Q812101) (← links)
- Admissibility of cut in LC with fixed point combinator (Q817697) (← links)
- Cut-elimination and quantification in canonical systems (Q817707) (← links)
- Correspondence analysis for some fragments of classical propositional logic (Q828774) (← links)
- A more unified approach to free logics (Q830379) (← links)
- Uniform interpolation and propositional quantifiers in modal logics (Q878154) (← links)
- Dual erotetic calculi and the minimal \(\mathsf{LFI}\) (Q897482) (← links)
- Tableaux and dual tableaux: transformation of proofs (Q995673) (← links)
- A normalizing system of natural deduction for intuitionistic linear logic (Q1407574) (← links)
- Sequent calculi for \(\mathsf{SCI}\) (Q1653652) (← links)
- Sequent calculi for semi-De Morgan and De Morgan algebras (Q1653653) (← links)
- A simple sequent calculus for Angell's logic of analytic containment (Q1685482) (← links)
- Negation-free and contradiction-free proof of the Steiner-Lehmus theorem (Q1704083) (← links)
- Proof theory for functional modal logic (Q1708100) (← links)
- Paradox and logical revision. A short introduction (Q1708458) (← links)
- Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 5--11, 2017 (Q1731963) (← links)
- Permutability of rules in lattice theory. (Q1771961) (← links)
- Varieties of linear calculi (Q1868337) (← links)
- Socratic proofs (Q1876085) (← links)
- Reasoning processes in propositional logic (Q1959223) (← links)
- Sequent calculi for intuitionistic Gödel-Löb logic (Q1982008) (← links)
- Recapturing dynamic logic of relation changers via bounded morphisms (Q2021560) (← links)
- A conservative negation extension of positive semilattice logic without the finite model property (Q2021561) (← links)
- A message-passing interpretation of adjoint logic (Q2035649) (← links)
- Reasoning with ambiguity (Q2035848) (← links)
- Subatomic negation (Q2035849) (← links)