Thomas Vetterlein

Bio: Thomas Vetterlein is an academic researcher from Johannes Kepler University of Linz. The author has contributed to research in topics: Commutative property & Space (mathematics). The author has an hindex of 13, co-authored 82 publications receiving 832 citations. Previous affiliations of Thomas Vetterlein include Medical University of Vienna & Slovak Academy of Sciences.

Pseudoeffect Algebras. I. Basic Properties

Abstract: As a noncommutative generalization of effect algebras, we introduce pseudoeffect algebras and list some of their basic properties. For the purpose of a structure theory, we further define several kinds of Riesz-like properties for pseudoeffect algebras and show how they are interrelated.

Pseudoeffect Algebras. II. Group Representations

Abstract: This paper is the continuation of the previous paper by Dvurecenskij and Vetterlein (2001), Int J Theor Phys 40(3) We show that any pseudoeffect algebra fulfilling a certain property of Riesz type is representable by a unit interval of some (not necessarily Abelian) partially ordered group The relation of pseudoeffect to pseudo-MV algebras is made clear, and the &ell-group representation theorem for the latter structure is re-proved

Congruences and States on Pseudoeffect Algebras

Abstract: We study congruences on pseudoeffect algebras, which were recently introduced as a non-commutative generalization of effect algebras. We introduce ideals for these algebras and give a sufficient condition for an ideal to determine a congruence. Furthermore, states on pseudoeffect algebras are considered. It is shown that any interval pseudoeffect algebra maps homomorphically into an effect algebra whose states are in a one-to-one correspondence to the states of the original algebra.

Algebras in the Positive Cone of po-Groups

Abstract: We systemize a number of algebras that are especially known in the field of quantum structures and that in particular arise from the positive cones of partially ordered groups. Generalized effect algebras, generalized difference posets, cone algebras, commutative BCK-algebras with the relative cancellation property, and positive minimal clans are included in the text. All these structures are conveniently characterizable as special cases of generalized pseudoeffect algebras, which we introduced in a previous paper. We establish the exact relations between all mentioned structures, thereby adding new structures whenever necessary to make the scheme of order complete. Generalized pseudoeffect algebras were under certain conditions proved to be representable by means of a po-group. From this fact, we will easily establish representation theorems for all of the structures included in discussion.

Automated Reasoning with Analytic Tableaux and Related Methods: International Conference, TABLEAUX 2000 St Andrews, Scotland, UK, July 3-7, 2000 Proceedings

Abstract: Invited Lectures.- Tableau Algorithms for Description Logics.- Modality and Databases.- Local Symmetries in Propositional Logic.- Comparison.- Design and Results of TANCS-2000 Non-classical (Modal) Systems Comparison.- Consistency Testing: The RACE Experience.- Benchmark Analysis with FaCT.- MSPASS: Modal Reasoning by Translation and First-Order Resolution.- TANCS-2000 Results for DLP.- Evaluating *SAT on TANCS 2000 Benchmarks.- Research Papers.- A Labelled Tableau Calculus for Nonmonotonic (Cumulative) Consequence Relations.- A Tableau System for Godel-Dummett Logic Based on a Hypersequent Calculus.- An Analytic Calculus for Quantified Propositional Godel Logic.- A Tableau Method for Inconsistency-Adaptive Logics.- A Tableau Calculus for Integrating First-Order and Elementary Set Theory Reasoning.- Hypertableau and Path-Hypertableau Calculi for some Families of Intermediate Logics.- Variants of First-Order Modal Logics.- Complexity of Simple Dependent Bimodal Logics.- Properties of Embeddings from Int to S4.- Term-Modal Logics.- A Subset-Matching Size-Bounded Cache for Satisfiability in Modal Logics.- Dual Intuitionistic Logic Revisited.- Model Sets in a Nonconstructive Logic of Partial Terms with Definite Descriptions.- Search Space Compression in Connection Tableau Calculi Using Disjunctive Constraints.- Matrix-Based Inductive Theorem Proving.- Monotonic Preorders for Free Variable Tableaux.- The Mosaic Method for Temporal Logics.- Sequent-Like Tableau Systems with the Analytic Superformula Property for the Modal Logics KB, KDB, K5, KD5.- A Tableau Calculus for Equilibrium Entailment.- Towards Tableau-Based Decision Procedures for Non-Well-Founded Fragments of Set Theory.- Tableau Calculus for Only Knowing and Knowing At Most.- A Tableau-Like Representation Framework for Efficient Proof Reconstruction.- The Semantic Tableaux Version of the Second Incompleteness Theorem Extends Almost to Robinson's Arithmetic Q.- System Descriptions.- Redundancy-Free Lemmatization in the Automated Model-Elimination Theorem Prover AI-SETHEO.- E-SETHEO: An Automated3 Theorem Prover.