default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRichard Zach
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j26]Landon D. C. Elkind
, Richard Zach:
The Genealogy of ''. Rev. Symb. Log. 16(3): 862-899 (2023)- 2022
- [j25]Richard Zach:
Corrections to: Natural Deduction for the Sheffer Stroke and Peirce's Arrow (and any Other Truth-Functional Connective). J. Philos. Log. 51(3): 691 (2022) - [j24]Matthias Baaz, Richard Zach:
Epsilon theorems in Intermediate Logics. J. Symb. Log. 87(2): 682-720 (2022) - 2021
- [j23]Richard Zach:
Cut Elimination and Normalization for generalized single and Multi-Conclusion Sequent and Natural Deduction Calculi. Rev. Symb. Log. 14(3): 645-686 (2021) - [j22]Samara Burns, Richard Zach:
Cut-Free Completeness for Modular Hypersequent Calculi for Modal Logics k, T, and d. Rev. Symb. Log. 14(4): 910-929 (2021) - 2017
- [j21]Georg Schiemer, Richard Zach, Erich H. Reck:
Carnap's early metatheory: scope and limits. Synth. 194(1): 33-65 (2017) - 2016
- [j20]Thomas Eiter, Richard Zach:
Helmut Veith (1971-2016). Bull. EATCS 119 (2016) - [j19]Richard Zach:
Helmut Veith (1971-2016) by Richard Zach. Bull. EATCS 119 (2016) - [j18]Richard Zach:
Natural Deduction for the Sheffer Stroke and Peirce's Arrow (and any Other Truth-Functional Connective). J. Philos. Log. 45(2): 183-197 (2016) - 2015
- [j17]Paolo Mancosu, Richard Zach:
Heinrich Behmann's 1921 Lecture on the Decision Problem and the Algebra of Logic. Bull. Symb. Log. 21(2): 164-187 (2015) - 2008
- [j16]Aldo Antonelli, Alasdair Urquhart, Richard Zach:
Mathematical Methods in Philosophy Editors' Introduction. Rev. Symb. Log. 1(2): 143-145 (2008) - 2007
- [j15]Matthias Baaz, Norbert Preining, Richard Zach:
First-order Gödel logics. Ann. Pure Appl. Log. 147(1-2): 23-47 (2007) - 2006
- [j14]Georg Moser, Richard Zach:
The Epsilon Calculus and Herbrand Complexity. Stud Logica 82(1): 133-155 (2006) - 2005
- [j13]Richard Zach:
Book Review: Michael Potter. Reason's Nearest Kin. Philosophies of Arithmetic from Kant to Carnap. Notre Dame J. Formal Log. 46(4): 503-513 (2005) - 2004
- [j12]Richard Zach:
Decidability of Quantified Propositional Intuitionistic Logic and S4 on Trees of Height and Arity ≤ω. J. Philos. Log. 33(2): 155-164 (2004) - 2003
- [j11]Richard Zach:
The Practice of Finitism: Epsilon Calculus and Consistency Proofs in Hilbert's Program. Synth. 137(1-2): 211-259 (2003) - 1999
- [j10]Richard Zach:
Completeness before Post: Bernays, Hilbert, and the development of propositional logic. Bull. Symb. Log. 5(3): 331-366 (1999) - 1998
- [j9]Matthias Baaz, Richard Zach:
Note on generalizing theorems in algebraically closed fields. Arch. Math. Log. 37(5-6): 297-307 (1998) - [j8]Matthias Baaz, Christian G. Fermüller, Gernot Salzer, Richard Zach:
Labeled Calculi and Finite-Valued Logics. Stud Logica 61(1): 7-33 (1998) - 1996
- [j7]Matthias Baaz, Alexander Leitsch, Richard Zach:
Completeness of a First-Order Temporal Logic with Time-Gaps. Theor. Comput. Sci. 160(1&2): 241-270 (1996) - 1995
- [j6]Matthias Baaz, Richard Zach:
Generalizing Theorems in Real Closed Fields. Ann. Pure Appl. Log. 75(1-2): 3-23 (1995) - 1994
- [j5]Petr Hájek, Richard Zach:
Review of Leonard Bolc and Piotr Borowik: Many-valued Logics: 1. Theoretical Foundations. J. Appl. Non Class. Logics 4(2): 215-220 (1994) - 1993
- [j4]Matthias Baaz, Christian G. Fermüller, Richard Zach:
Dual systems of sequents and tableaux for many-valued logics. Bull. EATCS 49: 192-197 (1993) - [j3]Matthias Baaz, Christian G. Fermüller, Richard Zach:
Dual systems of sequents and tableaux for many-valued logics. Bull. EATCS 51: 192-197 (1993) - [j2]Matthias Baaz, Christian G. Fermüller, Richard Zach:
Elimination of Cuts in First-order Finite-valued Logics. J. Inf. Process. Cybern. 29(6): 333-355 (1993) - 1992
- [j1]Matthias Baaz, Richard Zach:
Note on calculi for a three-valued logic for logic programming.. Bull. EATCS 48: 157-164 (1992)
Conference and Workshop Papers
- 2017
- [c17]Richard Zach:
Semantics and Proof Theory of the Epsilon Calculus. ICLA 2017: 27-47 - 2008
- [c16]Matthias Baaz, Richard Zach:
Effective Finite-Valued Approximations of General Propositional Logics. Pillars of Computer Science 2008: 107-129 - 2006
- [c15]Richard Zach:
Kurt Gödel and Computability Theory. CiE 2006: 575-583 - [c14]Matthias Baaz, Norbert Preining, Richard Zach:
Completeness of a Hypersequent Calculus for Some First-order Godel Logics with Delta. ISMVL 2006: 9 - 2003
- [c13]Georg Moser, Richard Zach:
The Epsilon Calculus (Tutorial). CSL 2003: 455 - [c12]Matthias Baaz, Norbert Preining, Richard Zach:
Characterization of the Axiomatizable Prenex Fragments of First-Order Gödel Logics. ISMVL 2003: 175-180 - 2001
- [c11]Christian G. Fermüller, Georg Moser, Richard Zach:
Tableaux for Reasoning About Atomic Updates. LPAR 2001: 639-653 - 2000
- [c10]Matthias Baaz, Richard Zach:
Hypersequent and the Proof Theory of Intuitionistic Fuzzy Logic. CSL 2000: 187-201 - [c9]Matthias Baaz, Agata Ciabattoni, Richard Zach:
Quantified Propositional Gödel Logics. LPAR 2000: 240-256 - 1998
- [c8]Matthias Baaz, Richard Zach:
Compact Propositional Gödel Logics. ISMVL 1998: 108-113 - 1996
- [c7]Matthias Baaz, Christian G. Fermüller, Gernot Salzer, Richard Zach:
MUltlog 1.0: Towards an Expert System for Many-Valued Logics. CADE 1996: 226-230 - 1995
- [c6]Matthias Baaz, Alexander Leitsch, Richard Zach:
Incompleteness of a First-Order Gödel Logic and Some Temporal Logics of Programs. CSL 1995: 1-15 - 1994
- [c5]Matthias Baaz, Richard Zach:
Approximating Propositional Calculi by Finite-Valued Logics. ISMVL 1994: 257-263 - 1993
- [c4]Matthias Baaz, Richard Zach:
Short Proofs of Tautologies Using the Schema of Equivalence. CSL 1993: 33-35 - [c3]Matthias Baaz, Christian G. Fermüller, Richard Zach:
Systematic Construction of Natural Deduction Systems for Many-Valued Logics. ISMVL 1993: 208-213 - [c2]Matthias Baaz, Christian G. Fermüller, Arie Ovrutcki, Richard Zach:
MULTILOG: A System for Axiomatizing Many-valued Logics. LPAR 1993: 345-347 - 1992
- [c1]Matthias Baaz, Richard Zach:
Algorithmic Structuring of Cut-free Proofs. CSL 1992: 29-42
Informal and Other Publications
- 2018
- [i2]Samara Burns, Richard Zach:
Relational Hypersequents for Modal Logics. CoRR abs/1805.09437 (2018) - [i1]Richard Zach:
Non-Analytic Tableaux for Chellas's Conditional Logic CK and Lewis's Logic of Counterfactuals VC. CoRR abs/1805.09446 (2018)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
