Richard Zach

Rev. Symb. Log., September, 2023

2022

Epsilon theorems in Intermediate Logics.

[BibT_eX]

[DOI]

J. Symb. Log., 2022

Corrections to: Natural Deduction for the Sheffer Stroke and Peirce's Arrow (and any Other Truth-Functional Connective).

[BibT_eX]

[DOI]

J. Philos. Log., 2022

2021

Cut Elimination and Normalization for generalized single and Multi-Conclusion Sequent and Natural Deduction Calculi.

[BibT_eX]

[DOI]

Rev. Symb. Log., 2021

Cut-Free Completeness for Modular Hypersequent Calculi for Modal Logics k, T, and d.

[BibT_eX]

[DOI]

Samara Burns

Rev. Symb. Log., 2021

2018

Non-Analytic Tableaux for Chellas's Conditional Logic CK and Lewis's Logic of Counterfactuals VC.

[BibT_eX]

[DOI]

CoRR, 2018

Relational Hypersequents for Modal Logics.

[BibT_eX]

[DOI]

Samara Burns

CoRR, 2018

2017

Carnap's early metatheory: scope and limits.

[BibT_eX]

[DOI]

Georg Schiemer

Erich H. Reck

Synth., 2017

Semantics and Proof Theory of the Epsilon Calculus.

[BibT_eX]

[DOI]

Proceedings of the Logic and Its Applications - 7th Indian Conference, 2017

2016

Natural Deduction for the Sheffer Stroke and Peirce's Arrow (and any Other Truth-Functional Connective).

[BibT_eX]

[DOI]

J. Philos. Log., 2016

Helmut Veith (1971-2016) by Richard Zach.

[BibT_eX]

[DOI]

Bull. EATCS, 2016

Helmut Veith (1971-2016).

[BibT_eX]

[DOI]

Thomas Eiter

Bull. EATCS, 2016

2015

Heinrich Behmann's 1921 Lecture on the Decision Problem and the Algebra of Logic.

[BibT_eX]

[DOI]

Paolo Mancosu

Bull. Symb. Log., 2015

2008

Mathematical Methods in Philosophy Editors' Introduction.

[BibT_eX]

[DOI]

Aldo Antonelli

Alasdair Urquhart

Rev. Symb. Log., 2008

Effective Finite-Valued Approximations of General Propositional Logics.

[BibT_eX]

[DOI]

Proceedings of the Pillars of Computer Science, 2008

2007

First-order Gödel logics.

[BibT_eX]

[DOI]

Norbert Preining

Ann. Pure Appl. Log., 2007

2006

The Epsilon Calculus and Herbrand Complexity.

[BibT_eX]

[DOI]

Georg Moser

Stud Logica, 2006

Completeness of a Hypersequent Calculus for Some First-order Godel Logics with Delta.

[BibT_eX]

[DOI]

Norbert Preining

Proceedings of the 36th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2006), 2006

Kurt Gödel and Computability Theory.

[BibT_eX]

[DOI]

Proceedings of the Logical Approaches to Computational Barriers, 2006

2005

Book Review: Michael Potter. <i>Reason's Nearest Kin. Philosophies of Arithmetic from Kant to Carnap</i>.

[BibT_eX]

[DOI]

Notre Dame J. Formal Log., 2005

2004

Decidability of Quantified Propositional Intuitionistic Logic and S4 on Trees of Height and Arity ≤ω.

[BibT_eX]

[DOI]

J. Philos. Log., 2004

2003

The Practice of Finitism: Epsilon Calculus and Consistency Proofs in Hilbert's Program.

[BibT_eX]

[DOI]

Synth., 2003

Characterization of the Axiomatizable Prenex Fragments of First-Order Gödel Logics.

[BibT_eX]

[DOI]

Norbert Preining

Proceedings of the 33rd IEEE International Symposium on Multiple-Valued Logic (ISMVL 2003), 2003

The Epsilon Calculus (Tutorial).

[BibT_eX]

[DOI]

Georg Moser

Proceedings of the Computer Science Logic, 17th International Workshop, 2003

2001

Tableaux for Reasoning About Atomic Updates.

[BibT_eX]

[DOI]

Georg Moser

Proceedings of the Logic for Programming, 2001

2000

Quantified Propositional Gödel Logics.

[BibT_eX]

[DOI]

Agata Ciabattoni

Proceedings of the Logic for Programming and Automated Reasoning, 2000

Hypersequent and the Proof Theory of Intuitionistic Fuzzy Logic.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 2000

1999

Completeness before Post: Bernays, Hilbert, and the development of propositional logic.

[BibT_eX]

[DOI]

Bull. Symb. Log., 1999

1998

Labeled Calculi and Finite-Valued Logics.

[BibT_eX]

[DOI]

Gernot Salzer

Stud Logica, 1998

Note on generalizing theorems in algebraically closed fields.

[BibT_eX]

[DOI]

Arch. Math. Log., 1998

Compact Propositional Gödel Logics.

[BibT_eX]

[DOI]

Proceedings of the 28th IEEE International Symposium on Multiple-Valued Logic, 1998

1996

Completeness of a First-Order Temporal Logic with Time-Gaps.

[BibT_eX]

[DOI]

Alexander Leitsch

Theor. Comput. Sci., 1996

MUltlog 1.0: Towards an Expert System for Many-Valued Logics.

[BibT_eX]

[DOI]

Gernot Salzer

Proceedings of the Automated Deduction - CADE-13, 13th International Conference on Automated Deduction, New Brunswick, NJ, USA, July 30, 1996

1995

Generalizing Theorems in Real Closed Fields.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 1995

Incompleteness of a First-Order Gödel Logic and Some Temporal Logics of Programs.

[BibT_eX]

[DOI]

Alexander Leitsch

Proceedings of the Computer Science Logic, 9th International Workshop, 1995

1994

Review of Leonard Bolc and Piotr Borowik: Many-valued Logics: 1. Theoretical Foundations.

[BibT_eX]

[DOI]

Petr Hájek

J. Appl. Non Class. Logics, 1994

Approximating Propositional Calculi by Finite-Valued Logics.

[BibT_eX]

[DOI]

Proceedings of the 24th IEEE International Symposium on Multiple-Valued Logic, 1994

1993

Elimination of Cuts in First-order Finite-valued Logics.

[BibT_eX]

J. Inf. Process. Cybern., 1993

Dual systems of sequents and tableaux for many-valued logics.

[BibT_eX]

Bull. EATCS, 1993

MULTILOG: A System for Axiomatizing Many-valued Logics.

[BibT_eX]

[DOI]

Arie Ovrutcki

Proceedings of the Logic Programming and Automated Reasoning,4th International Conference, 1993

Systematic Construction of Natural Deduction Systems for Many-Valued Logics.

[BibT_eX]

[DOI]

Proceedings of the 23rd IEEE International Symposium on Multiple-Valued Logic, 1993

Short Proofs of Tautologies Using the Schema of Equivalence.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 7th Workshop, 1993

1992

Note on calculi for a three-valued logic for logic programming..

[BibT_eX]

Bull. EATCS, 1992

Algorithmic Structuring of Cut-free Proofs.

[BibT_eX]

[DOI]