Related papers: The G\"odelizing Quantum-Mechanical Automata
We generalize some of the central results in automata theory to the abstraction level of coalgebras and thus lay out the foundations of a universal theory of automata operating on infinite objects. Let F be any set functor that preserves…
In recent years, G\"odel's ontological proof and variations of it were formalized and analyzed with automated tools in various ways. We supplement these analyses with a modeling in an automated environment based on first-order logic…
When investigating theories at the tiniest conceivable scales in nature, almost all researchers today revert to the quantum language, accepting the verdict from the Copenhagen doctrine that the only way to describe what is going on will…
It has been commonly argued, on the basis of Goedel's theorem and related mathematical results, that true artificial intelligence cannot exist. Penrose has further deduced from the existence of human intelligence that fundamental changes in…
We present an axiomatization of non-relativistic Quantum Mechanics for a system with an arbitrary number of components. The interpretation of our system of axioms is realistic and objective. The EPR paradox and its relation with realism is…
Automated theorem proving, or more broadly automated reasoning, aims at using computer programs to automatically prove or disprove mathematical theorems and logical statements. It takes on an essential role across a vast array of…
We first partly develop a mathematical notion of stable consistency intended to reflect the actual consistency property of human beings. Then we give a generalization of the first and second G\"odel incompleteness theorem to stably…
In this paper, we investigate the connection between Classical and Quantum Mechanics by dividing Quantum Theory in two parts: - General Quantum Axiomatics (a system is described by a state in a Hilbert space, observables are self-adjoint…
There is an increasing interest in applying recent advances in AI to automated reasoning, as it may provide useful heuristics in reasoning over formalisms in first-order, second-order, or even meta-logics. To facilitate this research, we…
G\"odel's ontological proof has been analysed for the first-time with an unprecedent degree of detail and formality with the help of higher-order theorem provers. The following has been done (and in this order): A detailed natural deduction…
We give a reframing of Godel's first and second incompleteness theorems that applies even to some undefinable theories of arithmetic. The usual Hilbert-Bernays provability conditions and the diagonal lemma are replaced by a more direct…
To study quantum computation, it might be helpful to generalize structures from language and automata theory to the quantum case. To that end, we propose quantum versions of finite-state and push-down automata, and regular and context-free…
A simplified variant of G\"odel's ontological argument is presented. The simplified argument is valid already in basic modal logics K or KT, it does not suffer from modal collapse, and it avoids the rather complex predicates of essence…
Quantum cellular automata consist in arrays of identical finite-dimensional quantum systems, evolving in discrete-time steps by iterating a unitary operator G. Moreover the global evolution G is required to be causal (it propagates…
After some historical remarks concerning Schroedinger's discovery of wave mechanics, we present a unified formalism for the mathematical description of classical and quantum-mechanical systems, utilizing elements of the theory of operator…
This paper proves that protomechanics, previously introduced in quant-ph/9909025, deduces both quantum mechanics and classical mechanics. It does not only solve the problem of the arbitrariness on the operator ordering for the quantization…
We study abstract versions of G\"odel's second incompleteness theorem and formulate generalizations of L\"ob's derivability conditions that work for logics weaker than the classical one. We isolate the role of contraction rule in G\"odel's…
Some of the most interesting and important results concerning quantum finite automata are those showing that they can recognize certain languages with (much) less resources than corresponding classical finite automata…
Automata learning is a popular technique for inferring minimal automata through membership and equivalence queries. In this paper, we generalise learning to the theory of coalgebras. The approach relies on the use of logical formulas as…
A simple argument shows that eigenstates of a classically ergodic system are individually ergodic on coarse-grained scales. This has implications for the quantization ambiguity in ergodic systems: the difference between alternative…