Discover open access scientific publications

Search, annotate, share and cite publications

Publications by Matthias Baaz

Theorem Proving for Prenex Gödel Logic With Delta: Checking Validity and Unsatisfiability

Logical Methods in Computer Science
Computer ScienceTheoretical Computer Science
2012English

A Note on the Complexity of Classical and Intuitionistic Proofs

2015English

Resolution-Based Theorem Proving for Many-Valued Logics

Journal of Symbolic Computation
Computational MathematicsNumber TheoryAlgebra
1995English

A Schütte-Tait Style Cut-Elimination Proof for First-Order Gödel Logic

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2002English

SAT in Monadic Gödel Logics: A Borderline Between Decidability and Undecidability

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Algorithmic Structuring of Cut-Free Proofs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1993English

Herbrand’s Theorem for Prenex Gödel Logic and Its Consequences for Theorem Proving

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2001English

Monadic Fragments of Gödel Logics: Decidability and Undecidability Results

English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy