The following publications are possibly variants of this publication:
- On the classification of first order Gödel logicsMatthias Baaz, Norbert Preining. APAL, 170(1):36-57, 2019. [doi]
- Incompleteness of a First-Order Gödel Logic and Some Temporal Logics of ProgramsMatthias Baaz, Alexander Leitsch, Richard Zach. csl 1996: 1-15
- First-order satisfiability in Gödel logics: An NP-complete fragmentMatthias Baaz, Agata Ciabattoni, Norbert Preining. TCS, 412(47):6612-6623, 2011. [doi]
- First-order satisfiability in Gödel logics: An NP-complete fragmentMatthias Baaz, Agata Ciabattoni, Norbert Preining. TCS, 412(47):6612-6623, 2011. [doi]
- A Schütte-Tait Style Cut-Elimination Proof for First-Order Gödel LogicMatthias Baaz, Agata Ciabattoni. tableaux 2002: 24-37 [doi]
- Cut Elimination for First Order Gödel Logic by Hyperclause ResolutionMatthias Baaz, Agata Ciabattoni, Christian G. Fermüller. lpar 2008: 451-466 [doi]
- Characterization of the Axiomatizable Prenex Fragments of First-Order Gödel LogicsMatthias Baaz, Norbert Preining, Richard Zach. ismvl 2003: 175-180 [doi]