Richard Zach

dblp:15/6648 · DBLP profile ↗
← Back
10ranked-venue papers
1as first author
1since 2021 · last 2022
0000-0003-1633-8324ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 10 · 1 first-author · 1 since 2021Artificial intelligence and machine learning · 4
YearPublicationVenuePosition
2022 Epsilon theorems in Intermediate Logics
abstract
Abstract Any intermediate propositional logic (i.e., a logic including intuitionistic logic and contained in classical logic) can be extended to a calculus with epsilon- and tau-operators and critical formulas. For classical logic, this results in Hilbert’s $\varepsilon $ -calculus. The first and second $\varepsilon $ -theorems for classical logic establish conservativity of the $\varepsilon $ -calculus over its classical base logic. It is well known that the second $\varepsilon $ -theorem fails for the intuitionistic $\varepsilon $ -calculus, as prenexation is impossible. The paper investigates the effect of adding critical $\varepsilon $ - and $\tau $ -formulas and using the translation of quantifiers into $\varepsilon $ - and $\tau $ -terms to intermediate logics. It is shown that conservativity over the propositional base logic also holds for such intermediate ${\varepsilon \tau }$ -calculi. The “extended” first $\varepsilon $ -theorem holds if the base logic is finite-valued Gödel–Dummett logic, and fails otherwise, but holds for certain provable formulas in infinite-valued Gödel logic. The second $\varepsilon $ -theorem also holds for finite-valued first-order Gödel logics. The methods used to prove the extended first $\varepsilon $ -theorem for infinite-valued Gödel logic suggest applications to theories of arithmetic.
Matthias Baaz, Richard Zach
J. Symb. Log.2
2007 First-order Gödel logics
Matthias Baaz, Norbert Preining, Richard Zach
Ann. Pure Appl. Log.3
2006 Kurt Gödel and Computability Theory
Richard Zach
CiE1
2001 Tableaux for Reasoning About Atomic Updates
Christian G. Fermüller, Georg Moser, Richard Zach
LPAR3
2000 Hypersequent and the Proof Theory of Intuitionistic Fuzzy Logic
Matthias Baaz, Richard Zach
CSL2
2000 Quantified Propositional Gödel Logics
Matthias Baaz, Agata Ciabattoni, Richard Zach
LPAR3
1996 MUltlog 1.0: Towards an Expert System for Many-Valued Logics
Matthias Baaz, Christian G. Fermüller, Gernot Salzer, Richard Zach
CADE4
1996 Completeness of a First-Order Temporal Logic with Time-Gaps
Matthias Baaz, Alexander Leitsch, Richard Zach
Theor. Comput. Sci.3
1995 Generalizing Theorems in Real Closed Fields
Matthias Baaz, Richard Zach
Ann. Pure Appl. Log.2
1993 MULTILOG: A System for Axiomatizing Many-valued Logics
Matthias Baaz, Christian G. Fermüller, Arie Ovrutcki, Richard Zach
LPAR4