Results 1 
3 of
3
Gödel on computability
"... Around 1950, both Gödel and Turing wrote papers for broader audiences. 1 Gödel drew in his 1951 dramatic philosophical conclusions from the general formulation of his second incompleteness theorem. These conclusions concerned the nature of mathematics and the human mind. The general formulation of t ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
Around 1950, both Gödel and Turing wrote papers for broader audiences. 1 Gödel drew in his 1951 dramatic philosophical conclusions from the general formulation of his second incompleteness theorem. These conclusions concerned the nature of mathematics and the human mind. The general formulation of the second theorem was explicitly based on Turing’s 1936 reduction of finite procedures to machine computations. Turing gave in his 1954 an understated analysis of finite procedures in terms of Post production systems. This analysis, prima facie quite different from that given in 1936, served as the basis for an exposition of various unsolvable problems. Turing had addressed issues of mentality and intelligence in contemporaneous essays, the best known of which is of course Computing machinery and intelligence. Gödel’s and Turing’s considerations from this period intersect through their attempt, on the one hand, to analyze finite, mechanical procedures and, on the other hand, to approach mental phenomena in a scientific way. Neuroscience or brain science was an important component of the latter for both: Gödel’s remarks in the Gibbs Lecture as well as in his later conversations with Wang and Turing’s Intelligent Machinery can serve as clear evidence for that. 2 Both men were convinced that some mental processes are not mechanical, in the sense that Turing machines cannot mimic them. For Gödel, such processes were to be found in mathematical experience and he was led to the conclusion that mind is separate from matter. Turing simply noted that for a machine or a brain it is not enough to be converted into a universal (Turing) machine in order to become intelligent: “discipline”, the characteristic
A Hierarchical Completeness Proof for Interval Temporal Logic with Finite Time
, 2003
"... Logics based on regular languages over finite words and #words o#er a promising but elusive framework for formal specification and verification. Starting with the seminal work of Buchi [5, 6] and Elgot [11] around 1960, a number of such logics and decision procedures have been proposed. ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Logics based on regular languages over finite words and #words o#er a promising but elusive framework for formal specification and verification. Starting with the seminal work of Buchi [5, 6] and Elgot [11] around 1960, a number of such logics and decision procedures have been proposed.
Using Temporal Logic to Analyse Temporal Logic: A Hierarchical Approach Based on Intervals
, 2007
"... Temporal logic has been extensively utilized in academia and industry to formally specify and verify behavioural properties of numerous kinds of hardware and software. We present a novel way to apply temporal logic to the study of a version of itself, namely, propositional lineartime temporal logic ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Temporal logic has been extensively utilized in academia and industry to formally specify and verify behavioural properties of numerous kinds of hardware and software. We present a novel way to apply temporal logic to the study of a version of itself, namely, propositional lineartime temporal logic (PTL). This involves a hierarchical framework for obtaining standard results for PTL, including a small model property, decision procedures and axiomatic completeness. A large number of the steps involved are expressed in a propositional version of Interval Temporal Logic (ITL) which is referred to as PITL. It is a natural generalization of PTL and includes operators for reasoning about periods of time and sequential composition. Versions of PTL with finite time and infinite time are both considered and one benefit of the framework is the ability to systematically reduce infinitetime reasoning to finitetime reasoning. The treatment of PTL with the operator until and past time naturally reduces to that for PTL without either one. The intervaloriented methodology differs from other analyses of PTL which typically