To support the students into an in-depth analysis of the main results of first order classical logic and to study some of their remarkable consequences.
Curriculum
teacher profile teaching materials
Part 1: Decidability and fundamental results of recursion theory. Primitive recursive functions and elementary functions: definitions and examples, elementary coding of the finite sequences of natural numbers, an alternative definition of the set of elementary functions. Ackermann's function and the (partial) recursive functions. Arithmetical hierarchy and representation (in N) of recursive functions. Arithmetization of syntax: coding of terms and formulas, satisfiability in N of Delta formulas is elementary, coding of sequence and derivations. The fundamental theorems of recursion theory. Decidability, semi-decidability, undecidability.
Part 2: Peano arithmetic. Peano's axioms and first order Peano’s axioms. The models of (first order) Peano arithmetic. The representable functions in (first order) Peano arithmetic. Incompleteness and undecidability: Church’s undecidability theorem, fixed point, Gödel’s first incompleteness theorem, Gödel’s second incompleteness theorem, final remarks on incompleteness, hints on incompleteness and second order logic.
Fruizione: 20710122 TEOREMI SULLA LOGICA, 2 in Scienze filosofiche LM-78 TORTORA DE FALCO LORENZO
Programme
Logic and Arithmetic: incompletenessPart 1: Decidability and fundamental results of recursion theory. Primitive recursive functions and elementary functions: definitions and examples, elementary coding of the finite sequences of natural numbers, an alternative definition of the set of elementary functions. Ackermann's function and the (partial) recursive functions. Arithmetical hierarchy and representation (in N) of recursive functions. Arithmetization of syntax: coding of terms and formulas, satisfiability in N of Delta formulas is elementary, coding of sequence and derivations. The fundamental theorems of recursion theory. Decidability, semi-decidability, undecidability.
Part 2: Peano arithmetic. Peano's axioms and first order Peano’s axioms. The models of (first order) Peano arithmetic. The representable functions in (first order) Peano arithmetic. Incompleteness and undecidability: Church’s undecidability theorem, fixed point, Gödel’s first incompleteness theorem, Gödel’s second incompleteness theorem, final remarks on incompleteness, hints on incompleteness and second order logic.
Core Documentation
V. Michele Abrusci e Lorenzo Tortora de Falco, Logica. Vol. 2 Incompletezza, teoria assiomatica degli insiemi, Springer, 2018Type of delivery of the course
The course includes Face-to-face lectures; Discussions with students and debates on the discussed topics; Exercices; Attendance is not mandatory but strongly recommended. In case of health emergency due to COVID-19 the way lectures will be given will depend on the conditions. In such a potential framework all the possible efforts will be done to limit the unavoidable damages related to the necessity to switch to online courses and interaction during the lessons will be preserved as much as possible. The lessons will be broadcasted live and won't be recorded.Type of evaluation
Oral exam, of a duration usually between 45 and 60 minutes. In case of health emergency due to COVID-19 the way exams will be held will depend on the conditions. In such a potential framework all the possible efforts will be done to limit the unavoidable damages related to the necessity to switch to online exams. teacher profile teaching materials
Part 1: Decidability and fundamental results of recursion theory. Primitive recursive functions and elementary functions: definitions and examples, elementary coding of the finite sequences of natural numbers, an alternative definition of the set of elementary functions. Ackermann's function and the (partial) recursive functions. Arithmetical hierarchy and representation (in N) of recursive functions. Arithmetization of syntax: coding of terms and formulas, satisfiability in N of Delta formulas is elementary, coding of sequence and derivations. The fundamental theorems of recursion theory. Decidability, semi-decidability, undecidability.
Part 2: Peano arithmetic. Peano's axioms and first order Peano’s axioms. The models of (first order) Peano arithmetic. The representable functions in (first order) Peano arithmetic. Incompleteness and undecidability: Church’s undecidability theorem, fixed point, Gödel’s first incompleteness theorem, Gödel’s second incompleteness theorem, final remarks on incompleteness, hints on incompleteness and second order logic.
Fruizione: 20710122 TEOREMI SULLA LOGICA, 2 in Scienze filosofiche LM-78 TORTORA DE FALCO LORENZO
Programme
Logic and Arithmetic: incompletenessPart 1: Decidability and fundamental results of recursion theory. Primitive recursive functions and elementary functions: definitions and examples, elementary coding of the finite sequences of natural numbers, an alternative definition of the set of elementary functions. Ackermann's function and the (partial) recursive functions. Arithmetical hierarchy and representation (in N) of recursive functions. Arithmetization of syntax: coding of terms and formulas, satisfiability in N of Delta formulas is elementary, coding of sequence and derivations. The fundamental theorems of recursion theory. Decidability, semi-decidability, undecidability.
Part 2: Peano arithmetic. Peano's axioms and first order Peano’s axioms. The models of (first order) Peano arithmetic. The representable functions in (first order) Peano arithmetic. Incompleteness and undecidability: Church’s undecidability theorem, fixed point, Gödel’s first incompleteness theorem, Gödel’s second incompleteness theorem, final remarks on incompleteness, hints on incompleteness and second order logic.
Core Documentation
V. Michele Abrusci e Lorenzo Tortora de Falco, Logica. Vol. 2 Incompletezza, teoria assiomatica degli insiemi, Springer, 2018Type of delivery of the course
The course includes Face-to-face lectures; Discussions with students and debates on the discussed topics; Exercices; Attendance is not mandatory but strongly recommended. In case of health emergency due to COVID-19 the way lectures will be given will depend on the conditions. In such a potential framework all the possible efforts will be done to limit the unavoidable damages related to the necessity to switch to online courses and interaction during the lessons will be preserved as much as possible. The lessons will be broadcasted live and won't be recorded.Type of evaluation
Oral exam, of a duration usually between 45 and 60 minutes. In case of health emergency due to COVID-19 the way exams will be held will depend on the conditions. In such a potential framework all the possible efforts will be done to limit the unavoidable damages related to the necessity to switch to online exams. teacher profile teaching materials
Part 1: Decidability and fundamental results of recursion theory. Primitive recursive functions and elementary functions: definitions and examples, elementary coding of the finite sequences of natural numbers, an alternative definition of the set of elementary functions. Ackermann's function and the (partial) recursive functions. Arithmetical hierarchy and representation (in N) of recursive functions. Arithmetization of syntax: coding of terms and formulas, satisfiability in N of Delta formulas is elementary, coding of sequence and derivations. The fundamental theorems of recursion theory. Decidability, semi-decidability, undecidability.
Part 2: Peano arithmetic. Peano's axioms and first order Peano’s axioms. The models of (first order) Peano arithmetic. The representable functions in (first order) Peano arithmetic. Incompleteness and undecidability: Church’s undecidability theorem, fixed point, Gödel’s first incompleteness theorem, Gödel’s second incompleteness theorem, final remarks on incompleteness, hints on incompleteness and second order logic.
Fruizione: 20710122 TEOREMI SULLA LOGICA, 2 in Scienze filosofiche LM-78 TORTORA DE FALCO LORENZO
Programme
Logic and Arithmetic: incompletenessPart 1: Decidability and fundamental results of recursion theory. Primitive recursive functions and elementary functions: definitions and examples, elementary coding of the finite sequences of natural numbers, an alternative definition of the set of elementary functions. Ackermann's function and the (partial) recursive functions. Arithmetical hierarchy and representation (in N) of recursive functions. Arithmetization of syntax: coding of terms and formulas, satisfiability in N of Delta formulas is elementary, coding of sequence and derivations. The fundamental theorems of recursion theory. Decidability, semi-decidability, undecidability.
Part 2: Peano arithmetic. Peano's axioms and first order Peano’s axioms. The models of (first order) Peano arithmetic. The representable functions in (first order) Peano arithmetic. Incompleteness and undecidability: Church’s undecidability theorem, fixed point, Gödel’s first incompleteness theorem, Gödel’s second incompleteness theorem, final remarks on incompleteness, hints on incompleteness and second order logic.
Core Documentation
V. Michele Abrusci e Lorenzo Tortora de Falco, Logica. Vol. 2 Incompletezza, teoria assiomatica degli insiemi, Springer, 2018Type of delivery of the course
The course includes Face-to-face lectures; Discussions with students and debates on the discussed topics; Exercices; Attendance is not mandatory but strongly recommended. In case of health emergency due to COVID-19 the way lectures will be given will depend on the conditions. In such a potential framework all the possible efforts will be done to limit the unavoidable damages related to the necessity to switch to online courses and interaction during the lessons will be preserved as much as possible. The lessons will be broadcasted live and won't be recorded.Type of evaluation
Oral exam, of a duration usually between 45 and 60 minutes. In case of health emergency due to COVID-19 the way exams will be held will depend on the conditions. In such a potential framework all the possible efforts will be done to limit the unavoidable damages related to the necessity to switch to online exams.