Pages that link to "Item:Q5773619"

The following pages link to Systems of Logic Based on Ordinals^† (Q5773619):

Displaying 50 items.

• Computation as an unbounded process (Q418791) (← links)
• Intuitionism and the liar paradox (Q448337) (← links)
• A personal account of Turing's imprint on the development of computer science (Q465701) (← links)
• Turing-Taylor expansions for arithmetic theories (Q514512) (← links)
• The machine as data: a computational view of emergence and definability (Q514566) (← links)
• Extending and interpreting Post's programme (Q636317) (← links)
• An implication of Gödel's incompleteness theorem. II: Not referring to the validity of oneself's assertion (Q662344) (← links)
• Constructive dimension and Turing degrees (Q733739) (← links)
• Ordinal arithmetic: Algorithms and mechanization (Q851144) (← links)
• Intervals containing exactly one c.e. degree (Q876386) (← links)
• Informal versus formal mathematics (Q885512) (← links)
• On mind \& Turing's machines (Q885688) (← links)
• Superefficiency from the vantage point of computability (Q900476) (← links)
• Coinduction for exact real number computation (Q1015372) (← links)
• The influence of domain interpretations on computational models (Q1036525) (← links)
• Emergence as a computability-theoretic phenomenon (Q1036528) (← links)
• How to build a hypercomputer (Q1036529) (← links)
• Interactive foundations of computing (Q1127523) (← links)
• Significato e verita nell'aritmetica peaniana (Q1221103) (← links)
• Independent axiomatizability of sets of sentences (Q1262853) (← links)
• On bimodal logics of provability (Q1332858) (← links)
• Toward a theory of intelligence (Q1434366) (← links)
• Super-tasks, accelerating Turing machines and uncomputability (Q1434371) (← links)
• The modal argument for hypercomputing minds (Q1434374) (← links)
• Hypercomputation: Philosophical issues (Q1434379) (← links)
• Axiomatizing provable \(n\)-provability (Q1732059) (← links)
• Mechanism, truth, and Penrose's new argument (Q1871136) (← links)
• Provability algebras and proof-theoretic ordinals. I (Q1877092) (← links)
• Iterated local reflection versus iterated consistency (Q1899141) (← links)
• On approximations for functions in the space of uniformly convergent Fourier series (Q2007611) (← links)
• Is there any real substance to the claims for a ``new computationalism''? (Q2011631) (← links)
• The origins of the halting problem (Q2043819) (← links)
• Turing: the great unknown (Q2151546) (← links)
• Semantics of quantum programming languages: Classical control, quantum control (Q2168785) (← links)
• The scope of Gödel's first incompleteness theorem (Q2254575) (← links)
• Informal and absolute proofs: some remarks from a Gödelian perspective (Q2288278) (← links)
• Investigations on the approximability and computability of the Hilbert transform with applications (Q2300755) (← links)
• The \$-calculus process algebra for problem solving: A paradigmatic shift in handling hard computational problems (Q2383594) (← links)
• Physical constraints on hypercomputation (Q2482458) (← links)
• The case for hypercomputation (Q2497872) (← links)
• Definability as hypercomputational effect (Q2497876) (← links)
• Computational power of infinite quantum parallelism (Q2498972) (← links)
• On the limit existence principles in elementary arithmetic and \(\varSigma_{n}^{0}\)-consequences of theories (Q2566065) (← links)
• A splitting theorem for $n-REA$ degrees (Q2750871) (← links)
• Mathematics, Metaphysics and the Multiverse (Q2891317) (← links)
• Formalism and intuition in computability (Q2941588) (← links)
• Mass problems and density (Q2951897) (← links)
• Reactive Turing Machines (Q3088297) (← links)
• Multi-Resolution Cellular Automata for Real Computation (Q3091455) (← links)
• Hierarchies of number-theoretic predicates (Q3226751) (← links)