( en | de | ru )

 

Disambiguation of "Baaz, Matthias"

Author of the publication

copydeleteadd this publication to your clipboard
Automatisches Beweisen für Logiksysteme, in denen Widersprüche behandelt werden können.

. ÖGAI, volume 151 of Informatik-Fachberichte, page 176-181. Springer, (1987)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Matthias Meyer

Musterbasiertes Re-Engineering von Softwaresystemen. Uni Paderborn, (2009)

Matthias Hägele

Immunrekonstitution nach haploidenter hämatopoetischer Stammzelltransplantation: Einfluss eines CD3-CD19-depletierten gegenüber einem CD34-selektionierten Transplantat. Uni Tübingen, (2008)

Matthias Schmidt

Topographische Verteilung und Morphometrie von retinalen Mikrogliazellen. Uni Münster, (2009)

Matthias Möller

Antikaons in infinite nuclear matter and nuclei. TU Darmstadt, (2007)

Matthias Zimmer

Risikomanagment: Fehlermanagment in der präklinischen Notfallmedizin. Uni Frankfurt Main, (2009)
 

Other publications of authors with the same name

Epsilon theorems in Intermediate Logics., and . J. Symb. Log., 87 (2): 682-720 (2022)Completeness of a First-Order Temporal Logic with Time-Gaps., , and . Theor. Comput. Sci., 160 (1&2): 241-270 (1996)Note on Conditional Constructivity.. Algebraic and Proof-theoretic Aspects of Non-classical Logics, volume 4460 of Lecture Notes in Computer Science, page 25-29. Springer, (2006)An Analytic Calculus for Quantified Propositional Gödel Logic., , and . TABLEAUX, volume 1847 of Lecture Notes in Computer Science, page 112-126. Springer, (2000)Automatisches Beweisen für Logiksysteme, in denen Widersprüche behandelt werden können.. ÖGAI, volume 151 of Informatik-Fachberichte, page 176-181. Springer, (1987)Note on witnessed Gödel logics with Delta., and . Ann. Pure Appl. Log., 161 (2): 121-127 (2009)Cut Normal Forms and Proof Complexity., and . Ann. Pure Appl. Log., 97 (1-3): 127-177 (1999)The Skolemization of existential quantifiers in intuitionistic logic., and . Ann. Pure Appl. Log., 142 (1-3): 269-295 (2006)On the non-confluence of cut-elimination., and . J. Symb. Log., 76 (1): 313-340 (2011)Cut-Elimination: Experiments with CERES., , , , and . LPAR, volume 3452 of Lecture Notes in Computer Science, page 481-495. Springer, (2004)