Bibliography

Overview

Tree

Index

Bibliography

PREV NEXT

FRAMES NO FRAME

&-0 1 2 3 4 5 6 7 8 9 A B C D E F G H I J K L M N O P Q R S T U V W Y Z

C

C

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.
"Kripke-Type Semantics for Da Costa's Paraconsistent Logic $C$ _ω" (1986)
in: Ciabattoni A. and Fermüller C.
"Hypersequents as a uniform framework for Urquhart's C, MTL and related logics" (2001)
in: Ciabattoni A.
"On Urquhart's C logic" (2000)

C. Jabloner F. S.

in: Baaz M.
"Logik des Juridischen Schließens" (2001)

CA

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

CADE

in: Baaz M., Leitsch A. and Moser G.
"System Description: CutRes 0.1: Cut Elimination by Resolution" (1999)
in: Baaz M., Fermüller C. G., Salzer G. and Zach R.
"MUltlog 1.0: Towards an Expert System for Many-valued Logics" (1996)

CADE-18

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

Calculations

in: Baaz M.
"Note on Generalization of Calculations" (1999)

Calculi

in: Aguzzoli S., Ciabattoni A. and Nola A. D.
"Sequent calculi for finite-valued Lukasiewicz logics via boolean decompositions" (2000)
in: Baaz M., Ciabattoni A. and Montagna F.
"Analytic Calculi for Monoidal T-norm Based Logic" (2004)
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.
"Analytic Calculi for Projective Logics" (1999)
in: Baaz M., Fermüller C. G., Salzer G. and Zach R.
"Labeled Calculi and Finite-valued Logics" (1998)
in: Baaz M., Fermüller C. G. and Salzer G.
"Systematic Construction of Calculi for Finite-Valued First-Order Logics" (1995)
in: Baaz M. and Zach R.
"Approximatig Propositional Calculi by Finite-valued Logics" (1994)
in: Baaz M.
"Logical Calculi Applied to Problems in Computer Science" (1992)
in: Baaz M. and Zach R.
"Note on Calculi for a Three-Valued Logic for Logic Programming" (1992)
in: Baaz M.
"The Application of Sequent Calculi to Non-Classical Logics" (1984)
in: Ciabattoni A. and Ferrari M.
"Hypersequent calculi for some intermediate logics with bounded Kripke models" (2001)
in: Ciabattoni A. and Ferrari M.
"Hypertableau and Path-Hypertableau Calculi for some families of intermediate logics" (2000)

Calculus

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., Fermüller C. G. and Veith H.
"An Analytic Calculus for Quantified Propositional Gödel Logic" (2000)
in: Baaz M. and Zach R.
"First-order Temporal Logic with Time-Gaps: Complete Sequent Calculus and Resolution System. Revised Version" (1993)

Cantor-Bendixon

in: Preining N.
"Gödel logics and Cantor-Bendixon Analysis" (2002)

Castle

in: Aehlig K., Johannsen J., Schwichtenberg H. and Terwijn S. A.
"Linear ramified higher type recursion and parallel complexity" (2001)

Category

in: Asperti A. and Ciabattoni A.
"Effective Applicative Structures" (1995)

Characterization

in: Baaz M., Preining N. and Zach R.
"Characterization of the Axiomatizable Prenex Fragments of First-Order Gödel Logics" (2003)
in: Baron G. and Kuich W.
"The characterization of nonexpansive grammars by rational power series" (1981)
in: Iemhoff R.
"A(nother) characterization of Intuitionistic Propositional Logic" (2001)
in: Karner G. and Kuich W.
"A characterization of abstract families of algebraic power series" (1997)
in: Kuich W.
"Gaussian elimination and a characterization of algebraic power series" (1998)
in: Kuich W.
"The characterization of parallel ultralinear grammars by rational power series" (1981)

Charactize

in: Baaz M.
"Note on a Translation of Charactize Constructivity" (2003)

Choice

in: Brunner N., Svozil K. and Baaz M.
"The Axiom of Choice in Quantum Theory" (1996)

Christensen J.

in: Christensen J., Kanovei V., Terwijn S. A. and Zambella D.
"On the complexity of finitely additive measures" (1997)

Ciabattoni A.

in: Aguzzoli S. and Ciabattoni A.
" Finiteness of infinite-valued Lukasiewicz logic" (2000)
in: Aguzzoli S., Ciabattoni A. and Nola A. D.
"Sequent calculi for finite-valued Lukasiewicz logics via boolean decompositions" (2000)
in: Asperti A. and Ciabattoni A.
"A Sufficient Condition for Completability of Partial Combinatory Algebras" (1997)
in: Asperti A. and Ciabattoni A.
"Effective Applicative Structures" (1995)
in: Baaz M., Ciabattoni A. and Montagna F.
"Analytic Calculi for Monoidal T-norm Based Logic" (2004)
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 Ciabattoni A.
"A Schütte-Tait Style Cut-Elimination Proof for First-Order Gödel Logic" (2002)
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.
"A Natural Deduction System for Intuitionistic Fuzzy 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., Ciabattoni A. and Zach R.
"Quantified propositional Gödel Logics" (2000)
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., Ciabattoni A., Fermüller C. G. and Veith H.
"Proof theory of fuzzy logic:Urquhart's C and related logics" (1998)
in: Ciabattoni A.
"A Proof-theoretical Investigation of Global Intuitionistic (Fuzzy) Logic" (2004)
in: Ciabattoni A. and Metcalfe G.
" Bounded Lukasiewicz Logics" (2003)
in: Ciabattoni A., Godo L. and Esteva F.
"T-norm based logics with $n$ -contraction" (2002)
in: Ciabattoni A. and Ferrari M.
"Hypersequent calculi for some intermediate logics with bounded Kripke models" (2001)
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.
"On Urquhart's C logic" (2000)
in: Ciabattoni A.
"Bounded Contraction in Systems with Linearity" (1999)
in: Ciabattoni A., Gabbay D. and Olivetti N.
"Cut-free Proof Systems for Logics of Weak Excluded Middle" (1998)
in: Ciabattoni A. and Luchi D.
"Two Connections between Linear Logic and Lukasiewicz Logics" (1997)
in: Fermüller C. G. and Ciabattoni A.
"From Intuitionistic Logics to Gödel-Dummett Logic via Parallel Dialogue Games" (2003)

Cimento

in: Brunner N., Svozil K. and Baaz M.
"Effective quantum observables" (1995)

Civil

in: Baaz M. and Quirchmayr G.
"Models of Civil Procedures Based on Multiple-Valued Logic" (1988)

Class

in: Baaz M. and Zach R.
"Compact Propositional Gödel Logic" (1998)
in: Kucera A. and Terwijn S. A.
"Lowness for the class of random sets" (1999)
in: Preining N.
"Sketch-as-Proof" (1997)
in: Terwijn S. A.
"On the quantitative structure of $Δ$ ₂" (2001)

Classes

in: Honkala J. and Kuich W.
"On four classes of Lindenmayerian power series" (1995)

Classical

in: Baaz M. and Fermüller C. G.
"A translation characterizing the constructive content of classical theories" (2003)

Classification

in: Baaz M., Preining N. and Zach R.
"On the classification of Gödel logics" (2004)

Clausal

in: Baaz M. and Leitsch A.
"Towards a clausal analysis of cut-elimination" (2004)

Clause

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

Closed

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)

Clote P. G.

in: Baaz M. and Zach R.
"Hypersequent and the Proof Theory of Intuitionistic Fuzzy Logic" (2000)

Clote P.

in: Baaz M. and Pudlák P.
"Kreisel's Conjecture for $L∃$ ₁" (1993)
in: Baaz M.
"Note on the Existence of Most-general Semi-unifiers" (1993)

Co-r

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

Collegium

in: Baaz M. and Leitsch A.
"Methods of Functional Extensions" (1995)

Colloq

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

Colloqium

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

Colloquium

in: Baaz M.
"Generalization of Proofs and Term Complexity" (1994)
in: Preining N.
"Sketch-as-Proof" (1997)

Color

in: Preining N.
"Sketch-as-Proof" (1997)

Combinatory

in: Asperti A. and Ciabattoni A.
"A Sufficient Condition for Completability of Partial Combinatory Algebras" (1997)
in: Baaz M., Brunner N. and Svozil K.
"Interpretations of Combinatory Algebras" (1993)

Common-Sense

in: Baaz M. and Hörwein K.
"A New Frame for Common-Sense Reasoning---Towards Local Inconsistencies" (1994)

Compact

in: Baaz M. and Zach R.
"Compact Propositional Gödel Logic" (1998)

Comparison

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

Completability

in: Asperti A. and Ciabattoni A.
"A Sufficient Condition for Completability of Partial Combinatory Algebras" (1997)

Complete

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., Terwijn S. A. and Zheng X.
"Resource bounded randomness and weakly complete problems" (1994)
in: Baaz M. and Zach R.
"First-order Temporal Logic with Time-Gaps: Complete Sequent Calculus and Resolution System. Revised Version" (1993)
in: Kuich W.
"Representations and complete semiring morphisms" (1995)
in: Kuich W.
"The Kleene and the Parikh theorem in complete semirings" (1987)
in: Preining N.
"Complete Recursive Axiomatizability of Gödel Logics" (2003)

Completeness

in: Baaz M., Leitsch A. and Zach R.
"Completeness of a First-order Temporal Logic with Time-Gaps" (1996)
in: Baaz M.
"Gödel's Justification of His Completeness Theorem" (1983)

Complexity

in: Aehlig K., Johannsen J., Schwichtenberg H. and Terwijn S. A.
"Linear ramified higher type recursion and parallel complexity" (2001)
in: Baaz M. and Leitsch A.
"Comparing the Complexity of Cut-Elimination Methods" (2001)
in: Baaz M. and Leitsch A.
"Cut Normal Forms and Proof Complexity" (1999)
in: Baaz M.
"Generalization of Proofs and Term Complexity" (1994)
in: Baaz M. and Leitsch A.
"On Skolemization and Proof Complexity" (1994)
in: Baaz M. and Pudlák P.
"Kreisel's Conjecture for $L∃$ ₁" (1993)
in: Baaz M.
"Note on the Existence of Most-general Semi-unifiers" (1993)
in: Baaz M. and Leitsch A.
"Complexity of Resolution Proofs and Function Introduction" (1992)
in: Baaz M., Hájek P., Montagna F. and Veith H.
"Complexity of t-Tautologies."
in: Beckmann A.
"A note on universal measures for weak implicit computational complexity" (2002)
in: Beckmann A.
"Dynamic ordinals -- universal measures for implicit computational complexity" (2002)
in: Christensen J., Kanovei V., Terwijn S. A. and Zambella D.
"On the complexity of finitely additive measures" (1997)
in: Hitchcock J. M., Lutz J. H. and Terwijn S. A.
"The arithmetical complexity of dimension and randomness" (2003)
in: Kuich W.
"The complexity of skewlinear tuple languages and $o$ -regular languages" (1971)
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.
"Complexity and randomness"

Comput

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: Jain S., Stephan F. and Terwijn S. A.
"Counting extensional differences in BC-learning"
in: Kuich W.
"Automata and languages generalized to $ω$ -continuous semirings" (1991)
in: Stephan F. and Terwijn S. A.
"The complexity of universal text-learners" (1999)

Computability

in: Terwijn S. A.
"Computability and measure" (1998)

Computably

in: Downey R. and Terwijn S. A.
"Computably enumerable reals and uniformly presentable ideals" (2002)

Computation

in: Aguzzoli S., Ciabattoni A. and Nola A. D.
"Sequent calculi for finite-valued Lukasiewicz logics via boolean decompositions" (2000)
in: Ambos-spies K., Terwijn S. A. and Zheng X.
"Resource bounded randomness and weakly complete problems" (1994)
in: Baaz M. and Preining N.
"Propositional Quantifier Elimination for linearly ordered well founded Kripke frames of type $ω$ " (2004)
in: Baaz M. and Leitsch A.
"Towards a clausal analysis of cut-elimination" (2004)
in: Baaz M. and Leitsch A.
"Cut Elimination and redundancy-elimination by Resolution" (2000)
in: Baaz M. and Fermüller C. G.
"Resolution-Based Theorem Proving for Many-Valued Logics" (1995)
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)
in: Ciabattoni A. and Ferrari M.
"Hypersequent calculi for some intermediate logics with bounded Kripke models" (2001)
in: Stephan F. C. and Terwijn S. A.
"The complexity of universal text-learners" (1997)

Computational

in: Baaz M. and Pudlák P.
"Kreisel's Conjecture for $L∃$ ₁" (1993)
in: Baaz M.
"Note on the Existence of Most-general Semi-unifiers" (1993)
in: Baaz M.
"The Scheme of Identity: a Computational Point of View" (1993)
in: Beckmann A.
"A note on universal measures for weak implicit computational complexity" (2002)
in: Beckmann A.
"Dynamic ordinals -- universal measures for implicit computational complexity" (2002)
in: Preining N.
"Sketch-as-Proof" (1997)
in: Terwijn S. A. and Zambella D.
"Computational randomness and lowness" (2001)
in: Terwijn S. A.
"Extensional set learning" (1999)

Computer

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. 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., Ciabattoni A. and Fermüller C. G.
"Cut-Elimination in a Sequents-of-Relations Calculus for Gödel Logic" (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.
"On the Undecidability of Some Sub-classical First-order Logics" (1999)
in: Baaz M. and Zach R.
"Compact Propositional Gödel Logic" (1998)
in: Baaz M. and Leitsch A.
"Fast Cut-Elimination by Projection" (1997)
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.
"Infinite-valued Gödel Logics with 0-1-Projections and Relativizations" (1996)
in: Baaz M., Fermüller C. G. and Leitsch A.
"A Non-elementary Speed-Up in Proof Length by Structural Clause Form Transforamation" (1994)
in: Baaz M., Fermüller C. G. and Leitsch A.
"A Non-elementary Speed-Up in Proof Length by Structural Clause Form Transforamation" (1994)
in: Baaz M. and Zach R.
"Short Proofs of Tautologies Using the Schema of Equivalence" (1994)
in: Baaz M., Fermüller C. G., Quirchmayr G. and Zach R.
"A Many-Valued Logic for Default Reasoning" (1993)
in: Baaz M. and Zach R.
"Algorithmic Structuring of Cut-free Proofs" (1993)
in: Baaz M., Fermüller C. G. and Zach R.
"Systematic Construction of Natural Deduction Systems for Many-valued Logics" (1993)
in: Baaz M.
"The Scheme of Identity: a Computational Point of View" (1993)
in: Baaz M.
"Logical Calculi Applied to Problems in Computer Science" (1992)
in: Baaz M., Kastner F. and Quirchmayr G.
"A Formal Model of Managerial Decision Making" (1991)
in: Hitchcock J. M., Lutz J. H. and Terwijn S. A.
"The arithmetical complexity of dimension and randomness" (2003)
in: Iemhoff R.
"Towards a proof system for admissibility" (2003)
in: Karner G. and Kuich W.
"A characterization of abstract families of algebraic power series" (1997)
in: Kuich W.
"Gaussian elimination and a characterization of algebraic power series" (1998)
in: Kuich W.
"On the multiplicity equivalence problem for context-free grammars" (1994)

Computersprachen

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., 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)

Concept

in: Baaz M. and Quirchmayr G.
"Models of Juridical Decisions Based on the Concept of Possible Worlds" (1988)

Condition

in: Asperti A. and Ciabattoni A.
"A Sufficient Condition for Completability of Partial Combinatory Algebras" (1997)

Cones

in: Kuich W.
"Cones and abstract families of elements" (1997)

Conf

in: Baaz M.
"Proof Analysis by Resolution" (2002)
in: Baaz M., Leitsch A. and Moser G.
"System Description: CutRes 0.1: Cut Elimination by Resolution" (1999)
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: Baaz M., Galindo F., Quirchmayr G. and Vázqez M.
"The Application of Kripke-Type Structures to Regional Development Processes" (1993)

Conference

in: Asperti A. and Ciabattoni A.
"Effective Applicative Structures" (1995)
in: Baaz M. and Quirchmayr G.
"A Formal Model of Analogical Reasoning: a Logic Based Approach" (1991)
in: Beckmann A.
"A note on universal measures for weak implicit computational complexity" (2002)
in: Terwijn S. A.
"Extensional set learning" (1999)

Congress

in: Baaz M., Fermüller C. G. and Salzer G.
"Systematic Construction of Calculi for Finite-Valued First-Order Logics" (1995)
in: Baaz M. and Quirchmayr G.
"Analogical Reasoning and Logic Based Knowledge Representation in Business Environments" (1993)
in: Baaz M. and Quirchmayr G.
"Modelling Priorities in Legal Expert Systems" (1987)
in: Baaz M.
"Gödel's Justification of His Completeness Theorem" (1983)

Conjecture

in: Baaz M. and Pudlák P.
"Kreisel's Conjecture for $L∃$ ₁" (1993)

Connections

in: Ciabattoni A. and Luchi D.
"Two Connections between Linear Logic and Lukasiewicz Logics" (1997)

Consequences

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)

Consistency

in: Beckmann A.
"Proving consistency of equational theories in bounded arithmetic" (2002)
in: Beckmann A.
"Preservation theorems and restricted consistency statements in bounded arithmetic" (2001)

Constant

in: Beckmann A.
"Height restricted constant depth LK" (2003)

Constant-depth

in: Beckmann A. and Buss S. R.
"Separation results for the size of constant-depth propositional proofs" (2004)

Construction

in: Baaz M., Fermüller C. G. and Salzer G.
"Systematic Construction of Calculi for Finite-Valued First-Order Logics" (1995)
in: Baaz M., Fermüller C. G. and Zach R.
"Systematic Construction of Natural Deduction Systems for Many-valued Logics" (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., Fermüller C. G. and Zach R.
"Systematic Construction of Natural Deduction Systems for Many-valued Logics" (1992)

Constructive

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

Constructivity

in: Baaz M.
"Note on a Translation of Charactize Constructivity" (2003)

Content

in: Baaz M. and Fermüller C. G.
"A translation characterizing the constructive content of classical theories" (2003)

Context-free

in: Kuich W.
"On the multiplicity equivalence problem for context-free grammars" (1994)
in: Kuich W.
"On the entropy of context-free languages" (1970)
in: Kuich W.
"Systems of pushdown acceptors and context-free grammars" (1970)

Continuum

in: Terwijn S. A.
"On the quantitative structure of $Δ$ ₂" (2001)

Contraction

in: Ciabattoni A.
"Bounded Contraction in Systems with Linearity" (1999)

Contradictionary

in: Baaz M. and Quirchmayr G.
"Automated Theorem Proving for the Deduction of Knowledge in Databases with Contradictionary Information" (1988)

Contributions

in: Baaz M.
"Über den allgemeinen Gehalt von Beweisen" (1988)
in: Kuich W.
"Halbringe und ihre Anwendungen in der Automatentheorie" (1991)
in: Kuich W.
"Polynomalgebren, algebraische Systeme und Kellerautomaten" (1988)

Control

in: Baron G. and Kuich W.
"The characterization of nonexpansive grammars by rational power series" (1981)
in: Kuich W.
"Generating functions for derivation trees" (1980)
in: Kuich W. and Shyamasundar R. K.
"The structure generating function of some families of languages" (1976)
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)
in: Kuich W.
"On the entropy of context-free languages" (1970)

Costa

in: Baaz M.
"Kripke-Type Semantics for Da Costa's Paraconsistent Logic $C$ _ω" (1986)

Counterparts

in: Baaz M. and Fermüller C. G.
"Intuitionistic Counterparts of Finitely-valued Logics" (1996)

Cruz

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

CSL

in: Baaz M. and Moser G.
"On generalizations of semi-terms of particularly simple form" (2002)
in: Baaz M. and Moser G.
"On a generalisation of Herbrand's theorm" (2001)
in: Baaz M. and Zach R.
"Hypersequent and the Proof Theory of Intuitionistic Fuzzy Logic" (2000)
in: Baaz M. and Veith H.
"Quantifier Elimination in Fuzzy Logic" (1999)
in: Baaz M. and Leitsch A.
"Fast Cut-Elimination by Projection" (1997)
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. and Salzer G.
"Semi-Unification and Generalizations of a Particularly Simple Form" (1995)
in: Baaz M. and Zach R.
"Short Proofs of Tautologies Using the Schema of Equivalence" (1994)
in: Baaz M. and Zach R.
"Algorithmic Structuring of Cut-free Proofs" (1993)
in: Beckmann A.
"Resolution refutations and propositional proofs with height-restriction" (2002)

CSLI

in: Iemhoff R.
"A modal analysis of some principles of the Provability Logic of Heyting Arithmetic" (2001)

CTCS

in: Asperti A. and Ciabattoni A.
"Effective Applicative Structures" (1995)

Cut

in: Baaz M. and Leitsch A.
"Cut Elimination and redundancy-elimination by Resolution" (2000)
in: Baaz M. and Leitsch A.
"Cut Normal Forms and Proof Complexity" (1999)
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)

Cut-elimination

in: Baaz M. and Leitsch A.
"Towards a clausal analysis of cut-elimination" (2004)

Cut-Elimination

in: Baaz M. and Ciabattoni A.
"A Schütte-Tait Style Cut-Elimination Proof for First-Order Gödel Logic" (2002)
in: Baaz M. and Leitsch A.
"Comparing the Complexity of Cut-Elimination Methods" (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. and Leitsch A.
"Fast Cut-Elimination by Projection" (1997)

Cut-free

in: Baaz M. and Zach R.
"Algorithmic Structuring of Cut-free Proofs" (1993)
in: Baaz M. and Zach R.
"Introducing Atomic Cuts into Cut-free LK_B-Proofs" (1992)
in: Ciabattoni A., Gabbay D. and Olivetti N.
"Cut-free Proof Systems for Logics of Weak Excluded Middle" (1998)

CutRes

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

Cuts

in: Baaz M., Fermüller C. G. and Zach R.
"Elimination of Cuts in First-order Finite-valued Logics" (1994)
in: Baaz M. and Zach R.
"Introducing Atomic Cuts into Cut-free LK_B-Proofs" (1992)

Cybernet

in: Baaz M., Fermüller C. G. and Zach R.
"Elimination of Cuts in First-order Finite-valued Logics" (1994)
in: Kuich W.
"Hauptkegel algebraischer Potenzreihen" (1987)

Cybernetics

in: Baaz M. and Quirchmayr G.
"Modelling Priorities in Legal Expert Systems" (1987)

Czechoslovak

in: Baaz M. and Quirchmayr G.
"A Formal Model of Analogical Reasoning: a Logic Based Approach" (1991)

Czermak J.

in: Baaz M., Brunner N. and Svozil K.
"Interpretations of Combinatory Algebras" (1993)