&-0123456789ABCDEFGHIJKLMNOPQRSTUVWYZ
2
- 2
- in: Baaz M. and Leitsch A.
"Extensionskalküle und Beweiskomplexität" (1998)
- in: Baaz M., Leitsch A. and Zach R.
"Incompleteness of a First-Order Gödel Logic and Some Temporal Logics of Programs" (1995)
- in: Baaz M. and Zach R.
"First-order Temporal Logic with Time-Gaps: Complete Sequent Calculus and Resolution System. Revised Version" (1993)
- in: Baaz M., Fermüller C. G. and Zach R.
"Systematic Construction of Natural Deduction Systems for Many-valued Logics: Extended Report" (1993)
- in: Baaz M. and Zach R.
"Introducing Atomic Cuts into Cut-free -Proofs" (1992)
- in: Baaz M., Fermüller C. G. and Zach R.
"Systematic Construction of Natural Deduction Systems for Many-valued Logics" (1992)
- in: Preining N.
"Proof theory and proof systems for projective and affine geometry" (2002)
- in: Terwijn S. A.
"On the quantitative structure of " (2001)
- 2000
- in: Ambos-spies K., Merkle W., Reimann J. and Terwijn S. A.
"Almost complete sets" (2000)
- in: Baaz M., Fermüller C. G. and Veith H.
"An Analytic Calculus for Quantified Propositional Gödel Logic" (2000)
- in: Baaz M. and Zach R.
"Hypersequent and the Proof Theory of Intuitionistic Fuzzy Logic" (2000)
- in: Baaz M., Ciabattoni A. and Zach R.
"Quantified propositional Gödel Logics" (2000)
- in: Ciabattoni A. and Ferrari M.
"Hypertableau and Path-Hypertableau Calculi for some families of intermediate logics" (2000)
- in: Ciabattoni A.
"On Urquhart's C logic" (2000)
- in: Stephan F. and Terwijn S. A.
"Counting extensional differences in BC-learning" (2000)
- 2001
- in: Aehlig K., Johannsen J., Schwichtenberg H. and Terwijn S. A.
"Linear ramified higher type recursion and parallel complexity" (2001)
- in: Baaz M., Ciabattoni A., Preining N. and Veith H.
"A Guide to Quantified Propositional Gödel Logic" (2001)
- in: Baaz M., Ciabattoni A. and Fermüller C. G.
"Cut-Elimination in a Sequents-of-Relations Calculus for Gödel Logic" (2001)
- in: Baaz M., Ciabattoni A. and Fermüller C. G.
"Herbrand's Theorem for Prenex Gödel Logic and its Consequences for Theorem Proving" (2001)
- in: Baaz M. and Moser G.
"On a generalisation of Herbrand's theorm" (2001)
- in: Ciabattoni A. and Fermüller C.
"Hypersequents as a uniform framework for Urquhart's C, MTL and related logics" (2001)
- 2002
- in: Baaz M. and Ciabattoni A.
"A Schütte-Tait Style Cut-Elimination Proof for First-Order Gödel Logic" (2002)
- in: Baaz M.
"Proof Analysis by Resolution" (2002)
- in: Beckmann A.
"A note on universal measures for weak implicit computational complexity" (2002)
- in: Beckmann A.
"Resolution refutations and propositional proofs with height-restriction" (2002)
- in: Preining N.
"Gödel logics and Cantor-Bendixon Analysis" (2002)
- in: Terwijn S. A.
"On the Learnability of Hidden Markov Models" (2002)
- 2003
- in: Baaz M. and Fermüller C. G.
"A translation characterizing the constructive content of classical theories" (2003)
- in: Ciabattoni A. and Metcalfe G.
" Bounded Lukasiewicz Logics" (2003)
- in: Hitchcock J. M., Lutz J. H. and Terwijn S. A.
"The arithmetical complexity of dimension and randomness" (2003)
- 23rd
- in: Baaz M., Fermüller C. G. and Zach R.
"Systematic Construction of Natural Deduction Systems for Many-valued Logics" (1993)
- 24th
- in: Baaz M. and Zach R.
"Approximatig Propositional Calculi by Finite-valued Logics" (1994)
- 26th
- in: Baaz M. and Fermüller C. G.
"Intuitionistic Counterparts of Finitely-valued Logics" (1996)
- 28
- in: Baaz M. and Zach R.
"Compact Propositional Gödel Logic" (1998)
&-0123456789ABCDEFGHIJKLMNOPQRSTUVWYZ
Submit a bug
This document was generated by bib2html 1.2.
Copyright © 1998-04 Stéphane GALLAND (under the GNU General Public License)