Jan von Plato

dblp:01/4254 · DBLP profile ↗
← Back
8ranked-venue papers
3as first author
2since 2021 · last 2024
0000-0002-8370-9255ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 8 · 3 first-author · 2 since 2021
YearPublicationVenuePosition
2024 On the Proof Theory of Apodictic Syllogistic
Melissa Antonelli, Jan von Plato
AiML2
2024 90 years of Gödel's incompleteness theorems: Logic and computation
abstract
Abstract This volume is one of two special issues collecting articles by invited speakers of the conference ‘Celebrating 90 Years of Gödel’s Incompleteness Theorems’ held in Nürtingen (Germany) in July 2021. The conference was organized by the Carl Friedrich von Weizsäcker Center at the University of Tübingen with support by the ERC-funded project Gödel Enigma: Rediscovering Kurt Gödel through his unpublished works at the University of Helsinki and by the Kurt Gödel Society in Vienna.
Matthias Baaz, Marcel Ertel, Reinhard Kahle, Thomas Piecha, Jan von Plato
J. Log. Comput.5
2010 Combinatorial analysis of proofs in projective and affine geometry
Jan von Plato
Ann. Pure Appl. Log.1
2004 Proof systems for lattice theory
abstract
A formulation of lattice theory as a system of rules added to sequent calculus is given. The analysis of proofs for the contraction-free calculus of classical predicate logic known as G3c extends to derivations with the mathematical rules of lattice theory. It is shown that minimal derivations of quantifier-free sequents enjoy a subterm property: all terms in such derivations are terms in the endsequent. An alternative formulation of lattice theory as a system of rules in natural deduction style is given, both with explicit meet and join constructions and as a relational theory with existence axioms. A subterm property for the latter extends the standard decidable classes of quantificational formulas of pure predicate calculus to lattice theory.
Sara Negri, Jan von Plato
Math. Struct. Comput. Sci.2
2001 Sequent Calculus in Natural Deduction Style
abstract
Abstract. A sequent calculus is given in which the management of weakening and contraction is organized as in natural deduction. The latter has no explicit weakening or contraction, but vacuous and multiple discharges in rules that discharge assumptions. A comparison to natural deduction is given through translation of derivations between the two systems. It is proved that if a cut formula is never principal in a derivation leading to the right premiss of cut, it is a subformula of the conclusion. Therefore it is sufficient to eliminate those cuts that correspond to detour and permutation conversions in natural deduction.
Sara Negri, Jan von Plato
J. Symb. Log.2
1999 Order in open intervals of computable reals
Jan von Plato
Math. Struct. Comput. Sci.1
1998 From Kripke Models to Algebraic Counter-Valuations
Sara Negri, Jan von Plato
TABLEAUX2
1995 The Axioms of Constructive Geometry
Jan von Plato
Ann. Pure Appl. Log.1