* DavisPutnamRobinsonMatiyasevich work (10H): the general problem of the existence of integer solutions of Diophantine equations is algorithmically undecidable.
* a proof of consistency of the arithmetical axioms (2H), here Kurt Goedel, negative response from Goedel, euclidean geometry w/o parellel postulate incomplete, use of primitive recursive arithmetic for finitisitc calc, HilbertBernays provability conditions,
* CH, Goedel showed that ZF cannot disprove the CH, Cohen showed that ZF cannot prove the CH, construction of wellordering of the continuum, FF showed that there exists no definable wellordering of the continuum,
* Hilbert: we treat mathematics formally as what can be carried out in an axiom system; then we investigate questions of independence, consistency and completeness for these axioms,
* Turing’s result: any true statement is provable at some stage in the transfinite iteration process.
* tradeoff: incompleteness for uncertainty about the path due to param space, based on the result from Turing,
* autonomous transfinite progression of axiom systems, are there no genuine absolutely undecidable problems?
* axiom testing: To prove that they are not contradictory, that is, that a finite number of logical steps based upon them can never lead to contradictory results.
* Feferman: “So, for example, a real number whose square is −1 does not exist mathematically. But if it can be proved that the attributes assigned to the concept can never lead to a contradiction by the application of a finite number of logical processes, I say that the mathematical existence of the concept (for example, of a number or a function which satisfies certain conditions) is thereby proved.”
* logical constants with regards to semantical or inferential criteria
* Lindström: logical only if it is uniformly uniquely characterized by a set of axioms and rules of inference over every universe of discourse.
* Tarski: a unified conceptual apparatus which would supply a common basis for the whole of human knowledge.
* Tarski: paradigmatic use of set theory for the purposes of conceptual analysis.
* Tarski: explication of the notions of truth, of logical consequence and of what is a logical term.
* Tarski: reduces the notion of logical consequence to the notion of truth in a model
* Feferman: “From the structural point of view, our conception is that of a structure (N , 1, Sc, <), where N+ is generated from the initial unit 1 by closure N+ under the successor operation Sc, and for which m < n if m precedes n in the generation procedure. ”
* concepts of continuum: These are: (i) the Euclidean continuum, (ii) Cantor’s continuum, (iii) Dedekind’s continuum, (iv) the Hilbertian continuum, (v) the set of all paths in the full binary tree, and (vi) the set of all subsets of the natural numbers.
* axioms in geometry using betweenness, containment, congruence, based on Hilbert axiom system, with redundant Pasch’s theorem,
* Skolem for setbased approach to logic, multiple incorrect arguments within Penrose Goedelian argument,

Recent Posts
Archives
 July 2017
 May 2017
 February 2017
 September 2016
 April 2016
 April 2015
 December 2014
 November 2014
 September 2014
 July 2014
 June 2014
 May 2014
 March 2014
 February 2014
 January 2014
 December 2013
 November 2013
 October 2013
 September 2013
 August 2013
 June 2013
 May 2013
 April 2013
 March 2013
 February 2013
 January 2013
 December 2012
 November 2012
 October 2012
 September 2012
 August 2012
 July 2012
 June 2012
 April 2012
 March 2012
 February 2012
 January 2012
 December 2011
 November 2011
 October 2011
 September 2011
 August 2011
 July 2011
 October 2010