T

T

in: Fermüller C. G. and Preining N.
"A dialogie game for Intuitionistic Fuzzy Logic based on comparison of degrees of truth" (2003) 

Türk

in: Baaz M. and Fermüller C. G.
"A Resolution principle for Quantificational $S5$ with an Application to Knowledge Representation" (1993) 

T-norm

• in: Baaz M., Ciabattoni A. and Montagna F.
  "Analytic Calculi for Monoidal T-norm Based Logic" (2004)
• in: Ciabattoni A., Godo L. and Esteva F.
  "T-norm based logics with $n$-contraction" (2002)

T-Tautologies

in: Baaz M., Hájek P., Montagna F. and Veith H.
"Complexity of t-Tautologies." 

Tableaux

in: Baaz M. and Ciabattoni A.
"A Schütte-Tait Style Cut-Elimination Proof for First-Order Gödel Logic" (2002) 

TABLEAUX

in: Baaz M. and Ciabattoni A.
"A Schütte-Tait Style Cut-Elimination Proof for First-Order Gödel Logic" (2002) 

Tableaux

in: Baaz M.
"Proof Analysis by Resolution" (2002) 

TABLEAUX

in: Baaz M.
"Proof Analysis by Resolution" (2002) 

Tableaux

in: Baaz M., Fermüller C. G. and Veith H.
"An Analytic Calculus for Quantified Propositional Gödel Logic" (2000) 

TABLEAUX

in: Baaz M., Fermüller C. G. and Veith H.
"An Analytic Calculus for Quantified Propositional Gödel Logic" (2000) 

Tableaux

in: Baaz M. and Fermüller C. G.
"Analytic Calculi for Projective Logics" (1999) 

TABLEAUX

in: Baaz M. and Fermüller C. G.
"Analytic Calculi for Projective Logics" (1999) 

Tableaux

• in: Baaz M., Egly U. and Fermüller C. G.
  "Lean Induction Principles for Tableaux" (1997)
• in: Baaz M., Egly U. and Fermüller C. G.
  "Lean Induction Principles for Tableaux" (1997)

TABLEAUX

in: Baaz M., Egly U. and Fermüller C. G.
"Lean Induction Principles for Tableaux" (1997) 

Tableaux

• in: Baaz M. and Fermüller C. G.
  "Combining Many-valued and Intuitionistic Tableaux" (1996)
• in: Baaz M. and Fermüller C. G.
  "Combining Many-valued and Intuitionistic Tableaux" (1996)

TABLEAUX

in: Baaz M. and Fermüller C. G.
"Combining Many-valued and Intuitionistic Tableaux" (1996) 

Tableaux

• in: Baaz M. and Fermüller C. G.
  "Non-elementary Speedups between Different Versions of Tableaux" (1995)
• in: Baaz M. and Fermüller C. G.
  "Non-elementary Speedups between Different Versions of Tableaux" (1995)

TABLEAUX

in: Baaz M. and Fermüller C. G.
"Non-elementary Speedups between Different Versions of Tableaux" (1995) 

Tableaux

• in: Baaz M., Fermüller C. G. and Zach R.
  "Dual Systems of Sequents and Tableaux for Many-valued Logics" (1993)
• in: Baaz M., Fermüller C. G. and Zach R.
  "Dual Systems of Sequents and Tableaux for Many-valued Logics" (1992)
• 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 Metcalfe G.
  " Bounded Lukasiewicz Logics" (2003)
• in: Ciabattoni A. and Ferrari M.
  "Hypertableau and Path-Hypertableau Calculi for some families of intermediate logics" (2000)
• 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)
• in: Ciabattoni A.
  "Bounded Contraction in Systems with Linearity" (1999)

Takeuti-Titani

in: Baaz M. and Veith H.
"An axiomatization of quantified proposition Gödel logic using the Takeuti-Titani rule" (1999) 

Tata

in: Baaz M. and Quirchmayr G.
"Analogical Reasoning and Logic Based Knowledge Representation in Business Environments" (1993) 

Tautologies

in: Baaz M. and Zach R.
"Short Proofs of Tautologies Using the Schema of Equivalence" (1994) 

Tbilisi

in: Beckmann A.
"A note on universal measures for weak implicit computational complexity" (2002) 

Tech

• in: Baaz M., Fermüller C. G. and Zach R.
  "Dual Systems of Sequents and Tableaux for Many-valued Logics" (1992)
• in: Kuich W.
  "Quantitative Aspekte bei Ableitungsbäumen" (1980)

Technische

• 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 $$LK_B-Proofs" (1992)
• in: Baaz M.
  "Logical Calculi Applied to Problems in Computer Science" (1992)
• in: Baaz M., Fermüller C. G. and Zach R.
  "Systematic Construction of Natural Deduction Systems for Many-valued Logics" (1992)

Technology

• in: Baaz M., Ciabattoni A., Fermüller C. G. and Veith H.
  "On the Undecidability of Some Sub-classical First-order Logics" (1999)
• in: Baaz M. and Quirchmayr G.
  "Analogical Reasoning and Logic Based Knowledge Representation in Business Environments" (1993)
• in: Preining N.
  "Complete Recursive Axiomatizability of Gödel Logics" (2003)
• in: Preining N.
  "Sketch-as-proof, a proof-theoretic analysis of axiomatic projective geometry" (1996)

Temporal

• in: Baaz M., Leitsch A. and Zach R.
  "Completeness of a First-order Temporal Logic with Time-Gaps" (1996)
• in: Baaz M., Leitsch A. and Zach R.
  "Incompleteness of a First-order Gödel Logic and Some Temporal Logics of Programs" (1996)
• 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.
  "An Effective Decision Algorithm for Propositional Temporal Logic" (1989)

Term

in: Baaz M.
"Generalization of Proofs and Term Complexity" (1994) 

Terwijn S. A.

• in: Aehlig K., Johannsen J., Schwichtenberg H. and Terwijn S. A.
  "Linear ramified higher type recursion and parallel complexity" (2001)
• in: Ambos-spies K., Merkle W., Riemann J. and Terwijn S. A.
  "Almost complete sets" (2003)
• in: Ambos-spies K., Merkle W., Reimann J. and Terwijn S. A.
  "Almost complete sets" (2000)
• in: Ambos-spies K., Terwijn S. A. and Zheng X.
  "Resource bounded randomness and weakly complete problems" (1997)
• in: Ambos-spies K., Neis H. and Terwijn S. A.
  "Genericity and measure for exponential time" (1996)
• in: Ambos-spies K., Terwijn S. A. and Zheng X.
  "Genericity and measure for exponential time" (1996)
• in: Ambos-spies K., Terwijn S. A. and Zheng X.
  "Resource bounded randomness and weakly complete problems" (1994)
• in: Christensen J., Kanovei V., Terwijn S. A. and Zambella D.
  "On the complexity of finitely additive measures" (1997)
• in: Downey R. and Terwijn S. A.
  "Computably enumerable reals and uniformly presentable ideals" (2002)
• in: Hitchcock J. M., Lutz J. H. and Terwijn S. A.
  "The arithmetical complexity of dimension and randomness" (2003)
• in: Jain S., Stephan F. and Terwijn S. A.
  "Counting extensional differences in BC-learning"
• in: Kucera A. and Terwijn S. A.
  "Lowness for the class of random sets" (1999)
• in: Stephan F. and Terwijn S. A.
  "Counting extensional differences in BC-learning" (2000)
• in: Stephan F. and Terwijn S. A.
  "The complexity of universal text-learners" (1999)
• in: Stephan F. C. and Terwijn S. A.
  "The complexity of universal text-learners" (1997)
• in: Terwijn S. A.
  "On the Learnability of Hidden Markov Models" (2002)
• in: Terwijn S. A. and Zambella D.
  "Computational randomness and lowness" (2001)
• in: Terwijn S. A.
  "On the quantitative structure of $\Delta$₂" (2001)
• in: Terwijn S. A.
  "Extensional set learning" (1999)
• in: Terwijn S. A. and Torenvliet L.
  "Arithmetical measure" (1998)
• in: Terwijn S. A.
  "Computability and measure" (1998)
• in: Terwijn S. A.
  "Complexity and randomness"

Teubner

in: Baaz M.
"Über den allgemeinen Gehalt von Beweisen" (1988) 

Text-learners

• in: Stephan F. and Terwijn S. A.
  "The complexity of universal text-learners" (1999)
• in: Stephan F. C. and Terwijn S. A.
  "The complexity of universal text-learners" (1997)

Th

• in: Baaz M. and Zach R.
  "Compact Propositional Gödel Logic" (1998)
• in: Preining N.
  "Sketch-as-Proof" (1997)

Their

• in: Baaz M. and Quirchmayr G.
  "A Logic Based Model of Legal Decision Making" (1990)
• in: Baaz M. and Quirchmayr G.
  "Models of Juridical Decisions Based on the Concept of Possible Worlds" (1988)
• in: Kuich W.
  "Semirings and formal power series: their relevance to formal languages and automata" (1997)

Theorem

• 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., 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 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. and Fermüller C. G.
  "Resolution-Based Theorem Proving for Many-Valued Logics" (1995)
• in: Baaz M., Fermüller C. G. and Zach R.
  "Dual Systems of Sequents and Tableaux for Many-valued Logics" (1992)
• 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. and Leitsch A.
  "Strong Splitting Rules in Automated Theorem Proving" (1989)
• in: Baaz M. and Quirchmayr G.
  "Automated Theorem Proving for the Deduction of Knowledge in Databases with Contradictionary Information" (1988)
• in: Baaz M. and Leitsch A.
  "Strong Inference in Automated Theorem Proving" (1986)
• in: Baaz M.
  "Gödel's Justification of His Completeness Theorem" (1983)
• in: Kuich W.
  "The Kleene and the Parikh theorem in complete semirings" (1987)

Theorems

• in: Baaz M. and Zach R.
  "Note on Generalizing Theorems in Algebraically Closed Fields" (1998)
• 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)
• in: Beckmann A.
  "Preservation theorems and restricted consistency statements in bounded arithmetic" (2001)

Theoret

• in: Ambos-spies K., Merkle W., Riemann J. and Terwijn S. A.
  "Almost complete sets" (2003)
• in: Ambos-spies K., Terwijn S. A. and Zheng X.
  "Resource bounded randomness and weakly complete problems" (1997)
• in: Ambos-spies K., Neis H. and Terwijn S. A.
  "Genericity and measure for exponential time" (1996)
• in: Ambos-spies K., Terwijn S. A. and Zheng X.
  "Genericity and measure for exponential time" (1996)
• in: Baaz M.
  "Note on Generalization of Calculations" (1999)
• in: Baaz M., Leitsch A. and Zach R.
  "Completeness of a First-order Temporal Logic with Time-Gaps" (1996)
• in: Beckmann A.
  "Notations for exponentiation" (2002)
• in: Honkala J. and Kuich W.
  "On Lindenmayerian algebraic power series" (1997)
• in: Kuich W.
  "Automata and languages generalized to $\omega$-continuous semirings" (1991)

Theoretical

• in: Baaz M., Ciabattoni A., Fermüller C. G. and Veith H.
  "On the Undecidability of Some Sub-classical First-order Logics" (1999)
• in: Kuich W.
  "On the multiplicity equivalence problem for context-free grammars" (1994)

Theorie

in: Kuich W.
"Zur Theorie algebraischer Systeme" (1981) 

Theories

• in: Baaz M. and Fermüller C. G.
  "A translation characterizing the constructive content of classical theories" (2003)
• in: Beckmann A.
  "Proving consistency of equational theories in bounded arithmetic" (2002)
• in: Iemhoff R.
  "Preservativity logic (An analogue of interpretability logic for constructive theories)" (2003)

Theorm

in: Baaz M. and Moser G.
"On a generalisation of Herbrand's theorm" (2001) 

Theory

• in: Aehlig K., Johannsen J., Schwichtenberg H. and Terwijn S. A.
  "Linear ramified higher type recursion and parallel complexity" (2001)
• in: Asperti A. and Ciabattoni A.
  "Effective Applicative Structures" (1995)
• in: Baaz M., Ciabattoni A. and Fermüller C. G.
  "Sequent of relations calculi: A framework for analytic deduction in many-valued logics" (2003)
• in: Baaz M. and Fermüller C. G.
  "A Note on the Proof-Theoretic Strength of a single application of the Schema of Identity" (2001)
• in: Baaz M. and Leitsch A.
  "Comparing the Complexity of Cut-Elimination Methods" (2001)
• in: Baaz M. and Zach R.
  "Hypersequent and the Proof Theory of Intuitionistic Fuzzy Logic" (2000)
• 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., Fermüller C. G. and Zach R.
  "Proof theory of finite-valued logics (Abstract)" (1995)
• in: Baaz M. and Pudlák P.
  "Kreisel's Conjecture for $L\exists$₁" (1993)
• in: Baaz M.
  "Note on the Existence of Most-general Semi-unifiers" (1993)
• in: Baaz M.
  "Automated Theorem Proving for Many-valued Logics (Theory)" (1990)
• in: Brunner N., Svozil K. and Baaz M.
  "The Axiom of Choice in Quantum Theory" (1996)
• in: Kuich W.
  "The algebraic equivalent of AFL theory" (1995)
• in: Preining N.
  "Proof theory and proof systems for projective and affine geometry" (2002)
• in: Preining N.
  "Sketch-as-Proof" (1997)
• in: Stephan F. C. and Terwijn S. A.
  "The complexity of universal text-learners" (1997)
• in: Terwijn S. A.
  "Extensional set learning" (1999)

Three-Valued

in: Baaz M. and Zach R.
"Note on Calculi for a Three-Valued Logic for Logic Programming" (1992) 

Time

• in: Ambos-spies K., Neis H. and Terwijn S. A.
  "Genericity and measure for exponential time" (1996)
• in: Ambos-spies K., Terwijn S. A. and Zheng X.
  "Genericity and measure for exponential time" (1996)

Time-Gaps

• in: Baaz M., Leitsch A. and Zach R.
  "Completeness of a First-order Temporal Logic with Time-Gaps" (1996)
• in: Baaz M. and Zach R.
  "First-order Temporal Logic with Time-Gaps: Complete Sequent Calculus and Resolution System. Revised Version" (1993)

Tiuryn J.

in: Baaz M. and Salzer G.
"Semi-Unification and Generalizations of a Particularly Simple Form" (1995) 

Torenvliet L.

in: Terwijn S. A. and Torenvliet L.
"Arithmetical measure" (1998) 

Towards

• in: Baaz M. and Leitsch A.
  "Towards a clausal analysis of cut-elimination" (2004)
• in: Baaz M., Fermüller C. G., Salzer G. and Zach R.
  "MUltlog 1.0: Towards an Expert System for Many-valued Logics" (1996)
• in: Iemhoff R.
  "Towards a proof system for admissibility" (2003)

Transforamation

in: Baaz M., Fermüller C. G. and Leitsch A.
"A Non-elementary Speed-Up in Proof Length by Structural Clause Form Transforamation" (1994) 

Transformations

in: Baaz M., Egly U. and Leitsch A.
"Normal Form Transformations" (2001) 

Translation

• in: Baaz M. and Fermüller C. G.
  "A translation characterizing the constructive content of classical theories" (2003)
• in: Baaz M.
  "Note on a Translation of Charactize Constructivity" (2003)

Tree

in: Beckmann A.
"A non-well-founded primitive recursive tree provably well-founded for co-r.e. sets" (2002) 

Trees

• in: Kuich W.
  "Generating functions for derivation trees" (1980)
• in: Kuich W., Prodinger H. and Urbanek F. J.
  "On the height of derivation trees" (1979)

Trends

• in: Kuich W.
  "Generalized Lindenmayerian algebraic systems" (1997)
• in: Kuich W.
  "On the multiplicity equivalence problem for context-free grammars" (1994)

Truth

in: Fermüller C. G. and Preining N.
"A dialogie game for Intuitionistic Fuzzy Logic based on comparison of degrees of truth" (2003) 

Tsukuba

• in: Baaz M.
  "Automated Theorem Proving for Many-valued Logics (Algorithms)" (1990)
• in: Baaz M.
  "Automated Theorem Proving for Many-valued Logics (Theory)" (1990)

Tt

in: Baaz M., Leitsch A. and Moser G.
"System Description: CutRes 0.1: Cut Elimination by Resolution" (1999) 

Tuple

• in: Kuich W.
  "The complexity of skewlinear tuple languages and $o$-regular languages" (1971)
• in: Kuich W. and Maurer H.
  "The structure generating function and entropy of tuple languages" (1971)

Twelfth

in: Terwijn S. A.
"Extensional set learning" (1999) 

Two

• in: Baaz M., Ciabattoni A. and Fermüller C. G.
  "Sequent of relations calculi: A framework for analytic deduction in many-valued logics" (2003)
• in: Ciabattoni A. and Luchi D.
  "Two Connections between Linear Logic and Lukasiewicz Logics" (1997)

Type

• in: Aehlig K., Johannsen J., Schwichtenberg H. and Terwijn S. A.
  "Linear ramified higher type recursion and parallel complexity" (2001)
• in: Baaz M. and Preining N.
  "Propositional Quantifier Elimination for linearly ordered well founded Kripke frames of type $\omega$" (2004)

Typed

in: Beckmann A.
"Exact bounds for lengths of reductions in typed $\lambda$-calculus" (2001) 

Submit a bug

This document was generated by bib2html 1.2.
Copyright © 1998-04 Stéphane GALLAND (under the GNU General Public License)