Norbert Preining

Publication Activity (10 Years)

Years Active: 1997-2024
Publications (10 Years): 6

Top Topics

Natural Deduction

Inference Rules

Datalog Queries

Predicate Logic

Top Venues

J. Log. Comput.

Publications

Sewon Park, Franz Brauße, Pieter Collins, SunYoung Kim, Michal Konecný, Gyesik Lee, Norbert Th. Müller, Eike Neumann, Norbert Preining, Martin Ziegler
Semantics, Specification Logic, and Hoare Logic of Exact Real Computation. Log. Methods Comput. Sci. 20 (2) (2024)
Matthias Baaz, Norbert Preining
On the classification of first order Gödel logics. Ann. Pure Appl. Log. 170 (1) (2019)
Arnold Beckmann, Norbert Preining
Hyper Natural Deduction for Gödel Logic - A natural deduction system for parallel reasoning. J. Log. Comput. 28 (6) (2018)
Arnold Beckmann, Norbert Preining
Deciding logics of linear Kripke frames with scattered end pieces. Soft Comput. 21 (1) (2017)
Matthias Baaz, Norbert Preining
Gödel logics and the fully boxed fragment of LTL. LPAR (2017)
Norbert Th. Müller, Sewon Park, Norbert Preining, Martin Ziegler
On Formal Verification in Imperative Multivalued Programming over Continuous Data Types. CoRR (2016)
Arnold Beckmann, Norbert Preining
Separating intermediate predicate logics of well-founded and dually well-founded structures by monadic sentences. J. Log. Comput. 25 (3) (2015)
Arnold Beckmann, Norbert Preining
Hyper Natural Deduction. LICS (2015)
Norbert Preining, Kazuhiro Ogata, Kokichi Futatsugi
Liveness Properties in CafeOBJ - A Case Study for Meta-Level Specifications. LOPSTR (2014)
Ana Erika Camargo Cruz, Hajimu Iida, Norbert Preining
An Empirical Illustration to Validate a FLOSS Development Model Using S-Shaped Curves. ICSM (2013)
Matthias Baaz, Agata Ciabattoni, Norbert Preining
First-order satisfiability in Gödel logics: An NP-complete fragment. Theor. Comput. Sci. 412 (47) (2011)
Norbert Preining
Gödel Logics - A Survey. LPAR (Yogyakarta) (2010)
Matthias Baaz, Agata Ciabattoni, Norbert Preining
SAT in Monadic Gödel Logics: A Borderline between Decidability and Undecidability. WoLLIC (2009)
Matthias Baaz, Norbert Preining
Quantifier Elimination for Quantified Propositional Logics on Kripke Frames of Type omega. J. Log. Comput. 18 (4) (2008)
Arnold Beckmann, Martin Goldstern, Norbert Preining
Continuous Fraïssé Conjecture. Order 25 (4) (2008)
Matthias Baaz, Norbert Preining, Richard Zach
First-order Gödel logics. Ann. Pure Appl. Log. 147 (1-2) (2007)
Arnold Beckmann, Norbert Preining
Linear Kripke frames and Gödel logics. J. Symb. Log. 72 (1) (2007)
Matthias Baaz, Norbert Preining, Richard Zach
Completeness of a Hypersequent Calculus for Some First-order Godel Logics with Delta. ISMVL (2006)
Matthias Baaz, Norbert Preining, Richard Zach
Characterization of the Axiomatizable Prenex Fragments of First-Order Gödel Logics. ISMVL (2003)
Norbert Preining
Gödel Logics and Cantor-Bendixon Analysis. LPAR (2002)
Norbert Preining
Sketch-as-Proof. Kurt Gödel Colloquium (1997)