&-0123456789ABCDEFGHIJKLMNOPQRSTUVWYZ
R
- Ramified
- in: Aehlig K., Johannsen J., Schwichtenberg H. and Terwijn S. A.
"Linear ramified higher type recursion and parallel complexity" (2001)
- Random
- in: Kucera A. and Terwijn S. A.
"Lowness for the class of random sets" (1999)
- Randomness
- in: Ambos-spies K., Terwijn S. A. and Zheng X.
"Resource bounded randomness and weakly complete problems" (1997)
- in: Ambos-spies K., Terwijn S. A. and Zheng X.
"Resource bounded randomness and weakly complete problems" (1994)
- in: Hitchcock J. M., Lutz J. H. and Terwijn S. A.
"The arithmetical complexity of dimension and randomness" (2003)
- in: Terwijn S. A. and Zambella D.
"Computational randomness and lowness" (2001)
- in: Terwijn S. A.
"Complexity and randomness"
- Rational
- in: Baron G. and Kuich W.
"The characterization of nonexpansive grammars by rational power series" (1981)
- in: Kuich W.
"The characterization of parallel ultralinear grammars by rational power series" (1981)
- Real
- in: Baaz M. and Zach R.
"Generalizing Theorems in Real Closed Fields" (1995)
- in: Baaz M. and Zach R.
"Generalizing theorems in real closed fields (Abstract)" (1995)
- Reals
- in: Downey R. and Terwijn S. A.
"Computably enumerable reals and uniformly presentable ideals" (2002)
- Reanimated
- in: Baaz M., Fermüller C. G., Gil A. J., Preining N. and Salzer G.
"MUltlog and MUltseq Reanimated and Married" (2003)
- Reasoning---Towards
- in: Baaz M. and Hörwein K.
"A New Frame for Common-Sense Reasoning---Towards Local Inconsistencies" (1994)
- Rechtslehre
- in: Baaz M.
"Logik des Juridischen Schließens" (2001)
- Recursion
- in: Aehlig K., Johannsen J., Schwichtenberg H. and Terwijn S. A.
"Linear ramified higher type recursion and parallel complexity" (2001)
- Recursive
- in: Beckmann A.
"A non-well-founded primitive recursive tree provably well-founded for co-r.e. sets" (2002)
- in: Preining N.
"Complete Recursive Axiomatizability of Gödel Logics" (2003)
- Reduction
- in: Baaz M. and Leitsch A.
"A Strong Problem Reduction Method Based on Function Introduction" (1990)
- Reductions
- in: Beckmann A.
"Exact bounds for lengths of reductions in typed -calculus" (2001)
- Reduktion
- in: Baaz M. and Leitsch A.
"Eine Methode zur Reduktion des Syntheseproblems" (1984)
- Reduktionsregeln
- in: Baaz M. and Leitsch A.
"Die Anwendung starker Reduktionsregeln in automatischen Beweisen" (1985)
- Redundancy-elimination
- in: Baaz M. and Leitsch A.
"Cut Elimination and redundancy-elimination by Resolution" (2000)
- Refutations
- in: Beckmann A.
"Resolution refutations and propositional proofs with height-restriction" (2002)
- Regional
- in: Baaz M., Galindo F., Quirchmayr G. and Vázqez M.
"The Application of Kripke-Type Structures to Regional Development Processes" (1993)
- Reimann J.
- in: Ambos-spies K., Merkle W., Reimann J. and Terwijn S. A.
"Almost complete sets" (2000)
- Reine
- in: Baaz M.
"Logik des Juridischen Schließens" (2001)
- Related
- 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: Baaz M., Fermüller C. G. and Veith H.
"An Analytic Calculus for Quantified Propositional Gödel Logic" (2000)
- in: Baaz M. and Fermüller C. G.
"Analytic Calculi for Projective Logics" (1999)
- in: Baaz M., Ciabattoni A., Fermüller C. G. and Veith H.
"Proof theory of fuzzy logic:Urquhart's C and related logics" (1998)
- in: Baaz M., Egly U. and Fermüller C. G.
"Lean Induction Principles for Tableaux" (1997)
- in: Baaz M. and Fermüller C. G.
"Combining Many-valued and Intuitionistic Tableaux" (1996)
- in: Baaz M. and Fermüller C. G.
"Non-elementary Speedups between Different Versions of Tableaux" (1995)
- in: Baaz M., Fermüller C. G. and Zach R.
"Dual Systems of Sequents and Tableaux for Many-valued Logics" (1992)
- in: Ciabattoni A. and Metcalfe G.
" Bounded Lukasiewicz Logics" (2003)
- in: Ciabattoni A. and Fermüller C.
"Hypersequents as a uniform framework for Urquhart's C, MTL and related logics" (2001)
- in: Ciabattoni A. and Ferrari M.
"Hypertableau and Path-Hypertableau Calculi for some families of intermediate logics" (2000)
- in: Ciabattoni A.
"Bounded Contraction in Systems with Linearity" (1999)
- Relations
- in: Baaz M., Ciabattoni A. and Fermüller C. G.
"Sequent of relations calculi: A framework for analytic deduction in many-valued logics" (2003)
- Relativizations
- in: Baaz M.
"Infinite-valued Gödel Logics with 0-1-Projections and Relativizations" (1996)
- Relevance
- in: Kuich W.
"Semirings and formal power series: their relevance to formal languages and automata" (1997)
- Rendiconti
- in: Terwijn S. A.
"Complexity and randomness"
- Report
- 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.
"Automated Theorem Proving for Many-valued Logics (Algorithms)" (1990)
- in: Baaz M.
"Automated Theorem Proving for Many-valued Logics (Theory)" (1990)
- Representation
- in: Baaz M. and Fermüller C. G.
"A Resolution principle for Quantificational with an Application to Knowledge Representation" (1993)
- in: Baaz M. and Quirchmayr G.
"Analogical Reasoning and Logic Based Knowledge Representation in Business Environments" (1993)
- Representations
- in: Kuich W.
"Representations and complete semiring morphisms" (1995)
- Research
- in: Baaz M.
"Automated Theorem Proving for Many-valued Logics (Algorithms)" (1990)
- in: Baaz M.
"Automated Theorem Proving for Many-valued Logics (Theory)" (1990)
- in: Baaz M.
"Quantifier elimination for heterogeneous quantifiers" (1987)
- in: Baaz M. and Leitsch A.
"Strong Inference in Automated Theorem Proving" (1986)
- in: Baaz M. and Leitsch A.
"Eine Methode zur Reduktion des Syntheseproblems" (1984)
- Resolution
- in: Baaz M.
"Proof Analysis by Resolution" (2002)
- in: Baaz M.
"Proof Analysis by Resolution" (2002)
- in: Baaz M. and Leitsch A.
"Cut Elimination and redundancy-elimination by Resolution" (2000)
- in: Baaz M., Leitsch A. and Moser G.
"System Description: CutRes 0.1: Cut Elimination by Resolution" (1999)
- in: Baaz M. and Leitsch A.
"Cut elimination by resolution" (1997)
- in: Baaz M. and Fermüller C. G.
"A Resolution principle for Quantificational with an Application to Knowledge Representation" (1993)
- 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. and Leitsch A.
"Complexity of Resolution Proofs and Function Introduction" (1992)
- in: Baaz M. and Fermüller C. G.
"Resolution for Many-valued Logics" (1992)
- in: Beckmann A.
"Resolution refutations and propositional proofs with height-restriction" (2002)
- Resolution-Based
- in: Baaz M. and Fermüller C. G.
"Resolution-Based Theorem Proving for Many-Valued Logics" (1995)
- Resource
- in: Ambos-spies K., Terwijn S. A. and Zheng X.
"Resource bounded randomness and weakly complete problems" (1997)
- in: Ambos-spies K., Terwijn S. A. and Zheng X.
"Resource bounded randomness and weakly complete problems" (1994)
- Restricted
- in: Beckmann A.
"Height restricted constant depth LK" (2003)
- in: Beckmann A.
"Preservation theorems and restricted consistency statements in bounded arithmetic" (2001)
- Results
- in: Beckmann A. and Buss S. R.
"Separation results for the size of constant-depth propositional proofs" (2004)
- in: Kuich W.
"On the multiplicity equivalence problem for context-free grammars" (1994)
- Review
- in: Iemhoff R.
"Review of: Submodels of Kripke Models, by A. Visser" (2002)
- Revised
- in: Baaz M. and Zach R.
"First-order Temporal Logic with Time-Gaps: Complete Sequent Calculus and Resolution System. Revised Version" (1993)
- Richter M. M.
- in: Baaz M. and Zach R.
"Algorithmic Structuring of Cut-free Proofs" (1993)
- Riemann J.
- in: Ambos-spies K., Merkle W., Riemann J. and Terwijn S. A.
"Almost complete sets" (2003)
- Rijke (de) M.
- in: Iemhoff R.
"A modal analysis of some principles of the Provability Logic of Heyting Arithmetic" (2001)
- RISC
- in: Baaz M.
"Quantifier elimination for heterogeneous quantifiers" (1987)
- in: Baaz M. and Leitsch A.
"Strong Inference in Automated Theorem Proving" (1986)
- in: Baaz M. and Leitsch A.
"Eine Methode zur Reduktion des Syntheseproblems" (1984)
- Rule
- in: Baaz M. and Veith H.
"An axiomatization of quantified proposition Gödel logic using the Takeuti-Titani rule" (1999)
- Rules
- in: Baaz M. and Leitsch A.
"Strong Splitting Rules in Automated Theorem Proving" (1989)
- in: Iemhoff R.
"On the admissible rules of Intuitionistic Propositional Logic" (2001)
- in: Iemhoff R.
"Provability Logic and Admissible Rules" (2001)
&-0123456789ABCDEFGHIJKLMNOPQRSTUVWYZ
Submit a bug
This document was generated by bib2html 1.2.
Copyright © 1998-04 Stéphane GALLAND (under the GNU General Public License)