20 citations · 27 across the 6 of their papers we have counts for
6 papers
Strong Kurtz Randomness and Binary Expansions of Reordered Computable Numbers
Peter Hertling, Philip Janicki
A real number is called left-computable if there exists a computable increasing sequence of rational numbers converging to it. In this article we investigate the Kolmogorov complex…
Regainingly approximable numbers and sets
Peter Hertling, Rupert Hölzl, Philip Janicki
We call an regainingly approximable if there exists a computable nondecreasing sequence of rational numbers converging to with for…
EXPSPACE-Completeness of the Logics K4xS5 and S4xS5 and the Logic of Subset Spaces, Part 2: EXPSPACE-Hardness
Peter Hertling, Gisela Krommes
It is known that the satisfiability problems of the product logics K4xS5 and S4xS5 are NEXPTIME-hard and that the satisfiability problem of the logic SSL of subset spaces is PSPACE…
EXPSPACE-Completeness of the Logics K4xS5 and S4xS5 and the Logic of Subset Spaces, Part 1: ESPACE-Algorithms
Peter Hertling, Gisela Krommes
It is known that the satisfiability problems of the product logics K4xS5 and S4xS5 and of the logic SSL of subset spaces are in N2EXPTIME. We improve this upper bound for the compl…
Embedding Quantum Universes into Classical Ones
Cristian S. Calude, Peter H. Hertling, Karl Svozil
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…
Kochen-Specker Theorem: Two Geometric Proofs
Cristian S. Calude, Peter H. Hertling, Karl Svozil
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 G…