Recent publications
[show/hide more] 
 Matthias Baaz and Norbert Preining.
On the Classification of First Order Gödel Logics.
Accepted for publication in the Annals of Pure and Applied Logic, 2018.
 Matthias Baaz and Norbert Preining.
First Order Gödel Logics with propositional quantifiers.
Accepted to LATD 2018.
 Arnold Beckmann and Norbert Preining.
Hyper Natural Deduction for Gödel Logic — A natural deduction system for parallel reasoning.
Journal of Logic and Computation, 28(6):11251187, 2018.
doi:10.1093/logcom/exy019.
 Matthias Baaz and Norbert Preining.
Gödel logics and the fully boxed fragment of FOLTL.
LPAR21. 21st International Conference on Logic for Programming, Artificial Intelligence and Reasoning.
EPiC Series in Computing 46:404416, 2017.
 Arnold Beckmann and Norbert Preining.
Deciding logics of linear Kripke frames with scattered end pieces.
(ShareIt PDF)
Soft Computing, 21(1):191197, 2017. doi:10.1007/s005000162400y.
 Norbert Preining.
10 years of TeX Live in Debian.
TUGboat, 37(1): 4547, 2016.
 Norbert Preining.
CafeOBJ as symbolic and algebraic computation engine.
数式処理 Bulletin of the Japan Society for Symbolic and Algebraic
Computation, 22(2):4851, 2016.
 Norbert Preining.
Adrian Frutiger, 19282015.
TUGboat, 36(3):182193, 2015.
 Norbert Preining and Arnold Beckmann.
Hyper Natural Deduction.
In Logic in Computer Science (LICS) 2015, 30th Annual ACM/IEEE Symposium
on, pages 547558, July 2015.
 Norbert Preining, Kazuhiro Ogata, and Kokichi Futatsugi.
Liveness properties in CafeOBJ – a case study for metalevel specifications.
In Maurizio Proietti and Hirohisa Seki, editors, LogicBased Program Synthesis and Transformation – 24th International Symposium, LOPSTR 2014, volume 8981 of Lecture Notes in Computer Science, pages 182–198. Springer, 2015.
Proceedings of LOPSTR 2014, Lecture Notes in Computer Science. Springer, 2015.
 Arnold Beckmann and Norbert Preining.
Separating intermediate predicate logics of wellfounded and dually
wellfounded structures by monadic sentences.
Journal of Logic and Computation, 2014. DOI 10.1093/logcom/exu016. Preprint PDF
 Norbert Preining, Kazuhiro Ogata, and Kokichi Futatsugi.
Liveness properties in CafeOBJ – a case study for metalevel specifications.
In Preliminary Proceedings of LOPSTR 2014, Technical Report IASICNR, pages 143157.
Istitute di Analisi dei Sistemi ed Informatica, 2014.
 Norbert Preining.
TUG 2013 in Tokyo.
TUGboat, 34(3):252258, 2013.
 Norbert Preining.
TeX Live Manager's hidden gems: User mode and multiple repository support.
TUGboat, 34(3):293296, 2013.
 Norbert Preining.
Redistributing TeX and friends.
TUGboat, 34(3):297301, 2013.
 Ana Erika Camargo Cruz, Hajimu Iida and Norbert Preining.
An Empirical Illustration to Validate a FLOSS Development Model Using SShaped Curves.
Software Maintenance (ICSM), 2013 29th IEEE International Conference, pages 468471, doi 10.1109/ICSM.2013.74.
September 2013.
 Matthias Baaz and Norbert Preining. GödelDummett logics. In Petr Cintula, Petr Hájek, and Carles Noguera, editors, Handbook of Mathematical Fuzzy Logic, volume 2, chapter VII, pages 585626. College Publications, 2011.
 Matthias Baaz, Agata Ciabattoni, and Norbert Preining. Firstorder satisability in Gödel logics: an NPcomplete fragment. Theoretical Computer Science, 412:66126623, 2011. Preprint PDF
 Matthias Baaz, Agata Ciabattoni, and Norbert Preining. SAT in monadic Gödel logics: A borderline between decidability and undecidability. In R. Queiroz H. Ono, M. Kanazawa, editor, WoLLIC 2009, number 5514 in LNCS, pages 113123, 2009. Preprint PDF
 Matthias Baaz and Norbert Preining. Quantifier Elimination for Quantied Propositional Logics on Kripke Frames of Type ω. Journal of Logic and Computation, 18(4):649668, 2008. Preprint PDF
 Arnold Beckmann, Martin Goldstern, and Norbert Preining. Continuous Fraïssé conjecture. Order, 25(4):281298, 2008. Preprint PDF
 Matthias Baaz, Norbert Preining, and Richard Zach. Firstorder Gödel logics. Annals of Pure and Applied Logic, 147:2347, 2007. Preprint PDF
 Arnold Beckmann and Norbert Preining. Linear Kripke frames and Gödel logics. Journal of Symbolic Logic, 71(1):2644, 2007. Preprint PDF
 Matthias Baaz, Norbert Preining, and Richard Zach. Completeness of a hypersequent calculus for some firstorder Gödel logics with delta. In Proceedings of ISMVL'06, page 9, 2006. Preprint PDF
 Christian G. Fermüller and Norbert Preining. A dialogie game for intuitionistic fuzzy logic based on comparison of degrees of truth. In Proceedings of the InTech'03, pages 142151, 2003. Preprint PDF
 Matthias Baaz, Christian G. Fermüller, Angel J. Gil, Norbert Preining, and Gernot Salzer. MUltlog and MUltseq reanimated and married. In B. Konev and R. Schmidt, editors, Proc. 4th Int. Workshop on the Implementation of Logics, Technical Report ulcs03018, 2003. Preprint PDF
 Matthias Baaz, Norbert Preining, and Richard Zach. Characterization of the axiomatizable prenex fragments of firstorder Gödel logics. In Proceedings of ISMVL'03, pages 175180, 2003. Preprint PDF
 Norbert Preining. Complete Recursive Axiomatizability of Gödel Logics. PhD
thesis, Vienna University of Technology, Austria, 2003. PDF
 Norbert Preining. Gödel logics and CantorBendixon analysis. In M. Baaz and A. Voronkov, editors, Proceedings of LPAR'2002, LNAI 2514, pages 327336, October 2002. Preprint PDF
 Norbert Preining. Proof theory and proof systems for projective and plane geometry. Technical Report tr2002fe01, Institut f. Computersprachen 185.2, August 2002. Position paper at the TABLEAUX 2002, Kopenhagen, Denmark.
 Matthias Baaz, Agata Ciabattoni, Norbert Preining, and Helmut Veith. A guide to quantied propositional Gödel logic. IJCAR workshop QBF 2001, June 2001. Siena, Italy. Preprint PDF
 Norbert Preining. Sketchasproof. In G. Gottlob, A. Leitsch, and D. Mundici, editors, Computational Logic and Proof Theory, Proc. 5th Kurt Gödel Colloquium KGC'97, Lecture Notes in Computer Science 1289, pages 264277, Vienna, Austria, 1997. Springer. Preprint PDF
 Norbert Preining. Sketchasproof, a prooftheoretic analysis of axiomatic
projective geometry. Master’s thesis, Vienna University of Technology, Austria, 1996. PDF

Recent talks
[show/hide more] 
 updmapとfmtutil ー 最近の更新と新しい機能（又は乱雑の掃除）. Talk at the TeXconf 2017  TeXユーザの集い, October 2017, Fujisawa, Japan.
 R – introduction and time series. Talk at the Mathematical Software and Education Workshop, Kyoto University, August 2017, Kyoto, Japan.
 fmtutil and updmap – past & future changes (or: cleaning up the mess). Talk at the TUG & BachoTEX 2017  TeX User Group Meeting, April 2017, Bachotek, Poland.
 Classification of First Order Gödel Logics. Talk at the Helmuth Veith Memorial Workshop, February 2017, Obergurgl, Austria.
 Classification of First Order Gödel Logics. Talk at the 第 51 回MLG数理論理学研究集会 (51th Meeting of the Mathematical Logic Group), October 2016, Hakone, Japan.
 Verification in Real Computation. Talk at the Workshop on Mathematical Logic and its Applications, September 2016, Kyoto, Japan.
 Algebraic Specification and Verification with CafeOBJ. Course at the ESSLLI 2016  28th European Summer School in Logic, Language and Information, August 2016, Bozen, Italy.
 Security improvements in TeX Live. TUG 2016  TeX User Group Meeting, July 2016, Toronto, Canada.
 Sketches in Projective Geometry  Orevkov’s speed up result in strange
surroundings. Talk at the Workshop on Efficient and Natural Proof Systems, December 2015, Bath, UK.
 A (quite) general method to prove nonre for Kripke frames and realvalued based logics. Talk at Logic at JAIST Workshop, December 2015, Kaga, Japan.
 CafeOBJ for real – Using an algebraic specification language as theorem prover. Talk at the Open Source Conference 2015 Fukuoka, October 2015, Fukuoka, Japan.
 Algebraic specifications and Functional programming with CafeOBJ. Talk at the MathLibre XXI Mathematical Software and Free Documents XXI, September 2015, Kyoto, Japan.
 Quer durch den Gemüsegarten von CafeOBJ (Zickzacking through the CafeOBJ’s vegetable garden). Talk at the 43rd TRS Meeting Term Rewriting Meeting, September 2015, Morioka, Japan.
 Gödel Logics, Hyper Sequent Calculus, and Hyper Natural Deduction. Talk at the CS Seminar Gunma University, July 2015, Kiryu, Japan.
 CafeOBJ for real  using an algebraic specification language as theorem prover for computational reals. Talk at CCA 2015 Twelfth International Conference on Computability and Complexity in Analysis, July 2015, Tokyo, Japan.
 Hyper Natural Deduction. Talk at LICS 2015  Logic in Computer Science, July 2015, Kyoto, Japan.
 CafeOBJ in unusual surroundings. Talk at JAIST Verification Center Workshop, June 2015, Kaga, Japan.
 CafeOBJ as symbolic and algebraic computation engine. Talk at the 日本数式処理学会 第２４回大会 (24. Annual Meeting of the Japan Society for Symbolic and Algebraic Computation), June 2015, Tsukuba University, Tsukuba, Japan.
 Introduction to CafeOBJ with case study. Talk at the IMI Seminar, March 2015, IMI, Kyushu University, Hakata, Japan.
 Liveness properties in CafeOBJ  a case study for metalevel specifications.
Talk at the LOPSTR 2014: LogicBased Program Synthesis and Transformation, September 2014, Canterbury, UK.
 Proving liveness properties using abstract state machines and nvisibility.
Talk at the WADT 2014: 22nd International Workshop on Algebraic Development Techniques,
September 2014, Sinaia, Romania.
 Liveness properties in CafeOBJ. Talk at the Verification Seminar,
JAIST, August 2014, Nomi, Japan.
 Intermediate Predicate Logics restricted to One Monadic Predicate Symbol.
Talk at the Logic, Algebra, and Truth Degrees  LATD 2014,
July 2014, Vienna, Austra.
 Specifying and verifying liveness properties of QLOCK in CafeOBJ.
Talk at the 14th International Workshop on Termination, July 2014,
Vienna, Austria.
 Algebraic Specification and Verification  CafeOBJ Research Group.
Talk at the 1st JAISTLORIA Workshop, April 2014, Kanazawa, Japan.
 Proof theory of projective geometry: Orevkov’s speed up result in strange surroundings. Talk at CTFM 2014, Tokyo Institute of Technology, February
2014, Tokyo, Japan.
 Intermediate Predicate Logics restricted to One Monadic Predicate Symbol.
PCV Seminar, Swansea University, November 2013, Swansea, Wales, UK.
 Gödel Logics  a short survey.
Seminar of the Logic Group, Bath University, November 2013, Bath, UK.
 Verification of a simplified cloudsync protocol and a new reference manual for CafeOBJ.
Research Meeting on CafeOBJ and Specification Verification, November 2013, Kaga, Japan.
 Verification with CafeOBJ II.
Ninth International Tbilisi Summer School in Logic and Language, October 2013, Tbilisi, Georgia.
 Verification with CafeOBJ I.
Ninth International Tbilisi Summer School in Logic and Language, October 2013, Tbilisi, Georgia.
 Separating intermediate predicate logics of some linear orders.
Talk at the TbiLLC 2013, Workshop on Algebraic Proof Theory, September 2013.
Gudauri, Georgia.
 Gödel logics  a short survey.
Talk at the Logic@JAIST Workshop, July 2013. Kaga, Japan.
 What can one monadic predicate symbol express on linear orders.
Talk at the 3rd Workshop on Proof Theory and Rewriting, March 2013.
Kanazawa, Japan.
 Gödel Logics, Order Theory, (Continuous) Fraïssé Conjecture.
Talk at the PCV Seminar, Swansea University, February 2013.
Swansea, Wales, UK.
 Walking the line  operators on various linear Kripke frame based logics. Talk at the Taiwan Philosophical Logic Colloquium, December 2012. Taipei, Taiwan.
 A decidable subclass of monadic Gödel Logics for medical reasoning. Talk at MLG'12, November 2012. Echigoyuzawa, Japan.
 Nonrecursive enumerability of logics of some linear Kripke frames over constant and increasing domains. Talk at Workshop on FirstOrder Intermediate Logics, October 2012. Shiramine, Japan.
 Gödel logics, continuous embeddability and continuous Fraïssé conjecture. Talk at the workshop Combinatorics in Learning Theory, September 2012. Fukuoka, Japan.
 Axiomatizability for some firstorder logics of linear Kripke frames over constant domains. Talk at IIACSIC Seminar, March 2012. Bellaterra, Catalonia, Spain.
 Quantied propositional Gödel logics logics of countable linearly ordered Kripke (frames with constant domains). Talk at Lambda Calculus Seminar, March 2012. Kusatsu Onsen, Japan.
 Axiomatizability for some firstorder logics of linear Kripke frames over constant domains. Talk at ncmpl 2011 Nonclassical Modal and Predicate Logics, December 2011. Guangzhou, China.
 Axiomatizability for some firstorder logics of linear Kripke frames over constant domains. Talk at MLG'11, October 2011. Echigoyuzawa, Japan.
 Kripke frames  Part 2, Seventh International Tbilisi Summer School in Logic and Language, Tbilisi, Georgia, 20110923
 Kripke frames  Part 1, Seventh International Tbilisi Summer School in Logic and Language, Tbilisi, Georgia, 20110922
 The semantic hierarchies of Gödel logics: Algebra verus Kripke frames, ACAN: Algebraic and Coalgebraic Approaches to NonClassical Logics, RIMS, Kyoto, Japan, 20110518
 Satisfiability in Monadic Gödel Logics, Workshop on Logic and Computation, Kanazawa, Japan, 20110208
 Gödel logics, 清华逻辑活动版 Tsinghua Logic Events, Tsinghua University, Beijing, China, 20101029
 Introduction to Proof Theory, 清华逻辑活动版 Tsinghua Logic Events, Tsinghua University, Beijing, China, 20101025
 Axiomatizability of some firstorder logics of linear Kripke frames over constant domains, NCMPL Nonclassical Modal and Predicate Logics 2011, Sun Yatsen University, Guangzhou, China, 20111206
 The semantic hierarchies of First order Gödel logics, Algebra versus Kripke frames, UniLog 2010, Universal Logic, Lisbon, Portugal, April 2010
 SAT in monadic Gödel Logics, WoLLIC 2009, Tokyo, Japan, June 2009
 SAT for Gödel logics, PR 2010  Proofs and Rewriting, Obergurgl, Austria, March 2010
 Herbrand disjunctions for the disentangled fragment of Gödel logics, Workshop on Structural Proof Theory, University Paris VII, Paris, France, November 2008
 Quantified propositional Gödel logics, Logical Models of Reasoning and Computation, LMR08, Steklov Institute, Moskow, Russia, May 2008
 Completeness of a Hypersequent Calculus for some Firstorder Gödel logics with Delta, MoscowVienna Workshop on Logic and Computation 2007, Vienna, Austria, July 2007
 A guide to quantified propositional Gödel logics, Order, Algebra, Logic, Vanderbilt University, Nashville, USA, June 2007
 Gödel logics, Kripke frames, and beyond, 3. International Workshop on Analytic Proof Systems, LPAR 2007, Erevan, Armenia, October 2007
 Fragments of Gödel Logics, Two and beyond  BarcelonaVienna Workshop on TruthFunctional logics, Barcelona, Spain, November 2007
 Gödel logics and CantorBendixon analysis, Ordered Structures in ManyValued Logics, Massa Lubrense, Italy, May 2006
 Linear Kripke frames and Gödel Logics, AsubL 3  Algebra and Substructural Logics  take 3, Krakow, Poland, November 2006
 Quantifier elimination for quantified propositional Gödel logics, 2. International Workshop on Analytic Proof Systems, LPAR 2006, Phnom Penh, Cambodia, November 2006
 Mathematical methods in firstorder Gödel logics, Methods'05: Algebraic and Topological Methods in NonClassical Logics II, Barcelona, Spain, June 2005
 Fragments of First Order Gödel Logics, Logics of Soft Computing 2005, Ostrava, Czech Republic, October 2005
 Counting finished: the number of Gödel Logics, Second FlorenceVienna Workshop on Logic and Computation, Florence, Italy, November 2005
 Order theory and Gödel logics, Kusatsu Logic Seminar, Kusatsu Onsen, Japan, March 2006
 Herbrand disjunctions and informal reasoning in projective geometry, Workshop on Analytic Proof Systems, LPAR 2004, Montevideo, Uruguay, March 2005
 Characterization of axiomatizability in Gödel logics, Kusatsu Logic Seminar, Kusatsu Onsen, Japan, March 2005
 Countable orderings and continuous embeddability, Third MoskowVienna Logic Meeting, Steklov Institute, Moskow, Russia, May 2004
 Semantics for Gödel Logics, ESF Workshop: Challenge of Semantics, Vienna, Austria, July 2004
 Characterization of Gödel logics with countable truth value sets, Logic of Soft Computing 2003, Siena, Italy, November 2003
 An overview on countable Gödel logics, First FlorenceVienna Workshop on Logic and Computation, Florence, Italy, January 2004
 Proof theory and proof systems for projective and affine geometry, TABLEAUX 2002, Kopenhagen, Danmark, August 2002
 Characterization of decidability of Gödel logics, Second MoscowVienna Logic Meeting, Steklov Institute, Moskow, Russia, April 2002
 Gödel logics and CantorBendixon analysis, LPAR 2002, Tbilisi, Georgia, October 2002
 Complete axiomatizations of Gödel logics, Logic of Soft Computing 2002, Anacapri, Italy, October 2002
 Sketches in affine geometry, Calculemus 2001, IJCAR 2001, Siena, Italy, June 2001
 A guide to quantified propositional Gödel logic, IJCAR Workshop QBF 2001, Siena, Italy, June 2001
 What to do with Herbrand disjunctions in geometry, Logic of Soft Computing 2001, Gargnano, Italy, November 2001
 Herbrand disjunctions and sketches, First MoskowVienna Logic Meeting, Steklov Institute, Moskow, Russia, December 2000
 How fast are sketches as proofs, Logic Colloquium 1998, Vienna, Austria, August 1998
 Sketchasproof, Kurt Gödel Colloquium 1997, Vienna, Austria, August 1997
