Peter H. Hertling
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Peter H. Hertling has a total of 25 co-authors. Here are the top co-authors by number of shared publications:
- Cristian S. Calude
The University of Auckland, New Zealand
3 shared publications - Karl Svozil
TU Wien
2 shared publications Alex J. Wilkie
1 shared publicationBakhadyr Khoussainov
1 shared publicationByunghan Kim
1 shared publicationDag Normann
1 shared publication
Latest Publications
- Open Access
Embedding Quantum Universes into Classical Ones
Do the partial order and ortholattice operations of a quantum logic correspond to the logical implication and connectives of classical logic? Re-phrased, how far might a classical understanding of quantum mechanics be, in principle, possible? A celebrated result by Kochen and Specker answers the above question in the negative. However, this answer is just one among different possible ones, not all negative. It is our aim to discuss the above question in terms of mappings of quantum worlds into classical ones, more specifically, in terms of embeddings of quantum logics into classical logics; depending upon the type of restrictions imposed on embeddings the question may get negative or positive answers.
Open AccessEmbedding Quantum Universes into Classical Ones
Do the partial order and ortholattice operations of a quantum logic correspond to the logical implication and connectives of classical logic? Re-phrased, how far might a classical understanding of quantum mechanics be, in principle, possible? A celebrated result by Kochen and Specker answers the above question in the negative. However, this answer is just one among different possible ones, not all negative. It is our aim to discuss the above question in terms of mappings of quantum worlds into classical ones, more specifically, in terms of embeddings of quantum logics into classical logics; depending upon the type of restrictions imposed on embeddings the question may get negative or positive answers.
- Open Access
Kochen-Specker Theorem: Two Geometric Proofs
We present two geometric proofs of the Kochen-Specker theorem. A quite similar argument has been used by Cooke, Keane, and Moran, as well as by Kalmbach in her book to derive the Gleason theorem.
Open AccessKochen-Specker Theorem: Two Geometric Proofs
We present two geometric proofs of the Kochen-Specker theorem. A quite similar argument has been used by Cooke, Keane, and Moran, as well as by Kalmbach in her book to derive the Gleason theorem.
- 17 June 1999
- Published by Cambridge University Press (CUP)
Models and Computability
Together, Models and Computability and its sister volume Sets and Proofs will provide readers with a comprehensive guide to the current state of mathematical logic. All the authors are leaders in their fields and are drawn from the invited speakers at 'Logic Colloquium '97' (the major international meeting of the Association of Symbolic Logic). It is expected that the breadth and timeliness of these two volumes will prove an invaluable and unique resource for specialists, post-graduate researchers, and the informed and interested nonspecialist.
- 17 June 1999
- Published by Cambridge University Press (CUP)
Models and Computability
Together, Models and Computability and its sister volume Sets and Proofs will provide readers with a comprehensive guide to the current state of mathematical logic. All the authors are leaders in their fields and are drawn from the invited speakers at 'Logic Colloquium '97' (the major international meeting of the Association of Symbolic Logic). It is expected that the breadth and timeliness of these two volumes will prove an invaluable and unique resource for specialists, post-graduate researchers, and the informed and interested nonspecialist.
- 1 January 1999
- Published by Wiley in Mathematical Logic Quarterly
- Vol. 45 (2) , 147-182
A Real Number Structure that is Effectively Categorical
On countable structures computability is usually introduced via numberings. For uncountable structures whose cardinality does not exceed the cardinality of the continuum the same can be done via representations. Which representations are appropriate for doing real number computations? We show that with respect to computable equivalence there is one and only one equivalence class of representations of the real numbers which make the basic operations and the infinitary normed limit operator computable. This characterizes the real numbers in terms of the theory of effective algebras or computable structures, and is reflected by observations made in real number computer arithmetic. Demanding computability of the normed limit operator turns out to be essential: the basic operations without the normed limit operator can be made computable by more than one class of representations. We also give further evidence for the well‐known non‐appropriateness of the representation to some basebby proving that strictly less functions are computable with respect to these representations than with respect to a standard representation of the real numbers. Furthermore we consider basic constructions of representations and the countable substructure consisting of the computable elements of a represented, possibly uncountable structure. For countable structures we compare effectivity with respect to a numbering and effectivity with respect to a representation. Special attention is paid to the countable structure of the computable real numbers.
- 1 January 1999
- Published by Wiley in Mathematical Logic Quarterly
- Vol. 45 (2) , 147-182
A Real Number Structure that is Effectively Categorical
On countable structures computability is usually introduced via numberings. For uncountable structures whose cardinality does not exceed the cardinality of the continuum the same can be done via representations. Which representations are appropriate for doing real number computations? We show that with respect to computable equivalence there is one and only one equivalence class of representations of the real numbers which make the basic operations and the infinitary normed limit operator computable. This characterizes the real numbers in terms of the theory of effective algebras or computable structures, and is reflected by observations made in real number computer arithmetic. Demanding computability of the normed limit operator turns out to be essential: the basic operations without the normed limit operator can be made computable by more than one class of representations. We also give further evidence for the well‐known non‐appropriateness of the representation to some basebby proving that strictly less functions are computable with respect to these representations than with respect to a standard representation of the real numbers. Furthermore we consider basic constructions of representations and the countable substructure consisting of the computable elements of a represented, possibly uncountable structure. For countable structures we compare effectivity with respect to a numbering and effectivity with respect to a representation. Special attention is paid to the countable structure of the computable real numbers.