Incompleteness Theorems, Large Cardinals, and Automata ov
|
|
- Damon Andrews
- 5 years ago
- Views:
Transcription
1 Incompleteness Theorems, Large Cardinals, and Automata over Finite Words Equipe de Logique Mathématique Institut de Mathématiques de Jussieu - Paris Rive Gauche CNRS and Université Paris 7 TAMC 2017, Berne
2 The Axiomatic System ZFC of Set Theory The axioms of ZFC (Zermelo 1908, Fraenkel 1922) express some natural facts that we consider to hold in the universe of sets. These axioms are first-order sentences in the logical language of set theory whose only non logical symbol is the membership binary relation symbol. The Axiom of Extensionality states that two sets x and y are equal iff they have the same elements: The Powerset Axiom states the existence of the set of subsets of a set x.
3 Models of the Axiomatic System ZFC A model (V, ) of the axiomatic system ZFC is a collection V of objects called sets, equipped with the membership relation, where x y means that the set x is an element of the set y, which satisfies the axioms of ZFC.
4 The Topological complexity of a 1-counter ω-language depends on the models of ZFC Theorem ( F ) There exists a 1-counter Büchi automaton A such that the topological complexity of the ω-language L(A) is not determined by the axiomatic system ZFC. 1 There is a model V 1 of ZFC in which the ω-language L(A) is an analytic but non Borel set. 2 There is a model V 2 of ZFC in which the ω-language L(A) is a G δ -set (i.e. Π 0 2 -set).
5 The context-free determinacy Theorem (F. 2011) The determinacy of Gale-Stewart games G(L), where L is accepted by a real-time 1-counter Büchi automaton, is equivalent to the effective analytic determinacy, and thus it is not provable in ZFC.
6 cardinals Two sets A and B have same cardinality is denoted A B. The relation is an equivalence relation. Using the axiom of choice AC, any set A can be well-ordered so there is an ordinal γ such that A γ. In set theory the cardinal of the set A is then formally defined as the smallest such ordinal γ. The infinite cardinals are denoted by ℵ 0, ℵ 1, ℵ 2,..., ℵ α,... The first infinite ordinal is ω and it is the smallest ordinal which is countably infinite so ℵ 0 = ω. The first uncountable ordinal is ω 1, and formally ℵ 1 = ω 1, and so on...
7 regular cardinals Let α be a limit ordinal, the cofinality of α, denoted cof (α), is the least ordinal β such that there exists a strictly increasing sequence of ordinals (α i ) i<β, of length β, such that i < β α i < α and sup i<β α i = α. This definition is usually extended to 0 and to the successor ordinals: cof (0) = 0 and cof (α + 1) = 1 for every ordinal α. The cofinality of a limit ordinal is always a limit ordinal satisfying: ω cof (α) α. Moreover cof (α) is in fact a cardinal. A cardinal κ is said to be regular iff cof (κ) = κ. Otherwise cof (κ) < κ and the cardinal κ is said to be singular.
8 inaccessible cardinals A cardinal κ is said to be a (strongly) inaccessible cardinal iff 1 κ > ω, 2 κ is regular, and 3 for all cardinals λ < κ it holds that 2 λ < κ, where 2 λ is the cardinal of P(λ). κ cannot be reached from smaller cardinals by the use of the powerset operation. This is a notion of large cardinal similar to the fact that ω is large with regard to the finite ordinals, i.e. integers.
9 The cumulative hierarchy The class of sets in a model V of ZF may be stratified in a transfinite hierarchy, called the Cumulative Hierarchy, which is defined by V = α ON V α, where: 1 V 0 = 2 V α = β<α V β, for α a limit ordinal, and 3 V α+1 = P(V α ). If V is a model of ZFC and κ is an inaccessible cardinal in V then V κ is also a model of ZFC.
10 One cannot prove in ZFC that there exists an inaccessible cardinal If V is a model of ZFC and κ is an inaccessible cardinal in V then V κ is also a model of ZFC. If there exist in V at least n inaccessible cardinals, where n 1 is an integer, and if κ is the n-th inaccessible cardinal, then V κ is also a model of ZFC + There exist exactly n 1 inaccessible cardinals. This implies that one cannot prove in ZFC that there exists an inaccessible cardinal, because if κ is the first inaccessible cardinal in V then V κ is a model of ZFC + There exist no inaccessible cardinals.
11 Consistency of a theory A (first-order) theory T in the language of set theory is a set of (first-order) sentences, called the axioms of the theory. If T is a theory and ϕ is a sentence then T ϕ iff there is a formal proof of ϕ from T. ( There is a finite sequence of sentences ϕ j, 1 j n, such that ϕ 1 ϕ 2... ϕ n, where ϕ n is the sentence ϕ and for each j [1, n], either ϕ j is in T or ϕ j is a logical axiom or ϕ j follows from ϕ 1, ϕ 2,... ϕ j 1 by usual rules of inference which can be defined purely syntactically. ) The theory T is consistent iff for no (first-order) sentence ϕ does T ϕ and T ϕ. If T is inconsistent, then for every sentence ϕ T ϕ.
12 Gödel s Second Incompleteness Theorem One can code in a recursive manner the sentences in the language of set theory by finite sequences over the alphabet {0, 1}, by using a classical Gödel numbering of the sentences. The theory T is said to be recursive iff the set of codes of axioms in T is a recursive set of words over {0, 1}. one can also code formal proofs from axioms of a recursive theory T and then Cons(T) is an arithmetical statement. The theory ZFC is recursive. Theorem (Gödel 1931) Let T be a consistent recursive extension of ZF or T = PA. Then T Cons(T ).
13 First Lemma Lemma Let T be a recursive theory (in the language of set theory or T = PA). Then there exists a Turing machine M T, starting on an empty tape, such that M T halts iff T is inconsistent. The machine M T works as a program which enumerates all the formal proofs from T and enters in an accepting state and then halts iff it finds a proof of the sentence x(x x). If the theory T is consistent the machine will never halt. But if the theory is inconsistent then at some point of the computation the machine finds a proof of x(x x) and halts.
14 Post Correspondence Problem The Post Correspondence Problem PCP is one of the famous undecidable problems in Theoretical Computer Science and in Formal Language Theory. It follows from the undecidability of the Post Correspondence Problem that many problems about context-free languages are also undecidable. the universality problem, the inclusion and the equivalence problems
15 Post Correspondence Problem Theorem (Post) Let Γ be an alphabet having at least two elements. Then it is undecidable to determine, for arbitrary n-tuples (x 1, x 2,..., x n ) and (y 1, y 2,..., y n ) of non-empty words in Γ, whether there exists a non-empty sequence of indices i 1, i 2,..., i k such that x i1 x i2 x ik = y i1 y i2 y ik.
16 Post Correspondence Problem and Set Theory Theorem Let T be a recursive theory (in the language of set theory or T = PA). Then there exist two n-tuples X T = (x 1, x 2,..., x n ) and Y T = (y 1, y 2,..., y n ) of finite words over a finite alphabet Σ, such that there exists a non-empty sequence of indices i 1, i 2,..., i k such that x i1 x i2 x ik = y i1 y i2 y ik iff T is inconsistent.
17 Post Correspondence Problem and Set Theory T n : ZFC + There exist (at least) n inaccessible cardinals Corollary For every integer n 0, there exist p 1 and two p-tuples X T,n = (x 1,n, x 2,n,..., x p,n ) and Y T,n = (y 1,n, y 2,n,..., y p,n ) of finite words over Σ = {a, b}, such that: P n : there exist no non-empty sequence of indices i 1, i 2,..., i k such that: x i1,nx i2,n x ik,n = y i1,ny i2,n y ik,n iff T n is consistent. In particular, if ZFC + There exist (at least) n inaccessible cardinals is consistent, then P n is provable from ZFC + There exist (at least) n + 1 inaccessible cardinals but not from ZFC + There exist (at least) n inaccessible cardinals.
18 Sketch of the proof P n is equivalent to Cons(T n ) One can prove from ZFC + There exist (at least) n + 1 inaccessible cardinals that if κ is the n + 1-th inaccessible cardinal, then the set V κ of the cumulative hierarchy is a model of ZFC + There exist n inaccessible cardinals. This implies that T n+1 Cons(T n ) (by Completeness Theorem) Thus T n+1 implies the property P n On the other hand if T n is consistent, then the property P n is not provable from T n. Indeed T n is then a consistent recursive extension of ZFC and thus by Gödel s Second Incompleteness Theorem we know that T n Cons(T n ).
19 Post Correspondence Problem and PA Moreover, since PA is consistent, we also get the following result. Corollary There exist two p-tuples X = (x 1, x 2,..., x p ) and Y = (y 1, y 2,..., y p ) of finite words over Σ = {a, b}, such that: (1) there exist no non-empty sequence of indices i 1, i 2,..., i k such that: x i1 x i2 x ik = y i1 y i2 y ik (2) The property (1) is not provable from PA.
20 Context-free grammars and Set Theory Theorem Let T be a recursive theory in the language of set theory or T = PA. Then there exists a context-free grammar G T which is unambiguous iff T is consistent. Corollary For every integer n 0, there exists a context-free grammar G n such that G n is unambiguous iff T n is consistent. In particular, if ZFC + There exist (at least) n inaccessible cardinals is consistent, then G n is unambiguous is provable from ZFC + There exist (at least) n + 1 inaccessible cardinals but not from ZFC + There exist (at least) n inaccessible cardinals.
21 Context-free grammars and Set Theory Corollary For every integer n 0, there exist context-free grammars G 1,n G 2,n, G 3,n, and G 4,n, such that Cons(T n ) is equivalent to each of the following items: (1) L(G 1,n ) L(G 2,n ) = ; (2) L(G 3,n ) = L(G 4,n ); (3) L(G 3,n ) = Γ, for some alphabet Γ. In particular, if ZFC + There exist (at least) n inaccessible cardinals is consistent, then each of the properties of these context-free languages given by Items (1)-(3) is provable from ZFC + There exist (at least) n + 1 inaccessible cardinals but not from ZFC + There exist (at least) n inaccessible cardinals.
22 Rational relations and Set Theory Theorem Let T be a recursive theory (in the language of set theory or T = PA). Then there exist 2-tape automata A, B, C, and D, accepting finitary rational relations X, Y, Z, L A B, for two alphabets A and B having at least two letters, and such that: Cons(T ) is equivalent to each of the following items: (1) X Y = ; (2) Z = A B ; (3) A B Z ; (4) L is accepted by a deterministic 2-tape automaton; (5) L is accepted by a synchronous 2-tape automaton.
23 Rational relations and Set Theory Corollary For every integer n 0, there exist 2-tape automata A n, B n, C n, and D n, accepting subsets of A B, for two alphabets A and B having at least two letters, such that Cons(T n ) is equivalent to each of the following items: (1) L(A n ) L(B n ) = ; (2) L(C n ) = A B ; (3) L(D n ) is accepted by a deterministic 2-tape automaton; (4) L(D n ) is accepted by a synchronous 2-tape automaton. In particular, if ZFC + There exist (at least) n inaccessible cardinals is consistent, then each of the properties of these 2-tape automata given by Items (1)-(4) is provable from ZFC + There exist (at least) n + 1 inaccessible cardinals but not from ZFC + There exist (at least) n inaccessible cardinals.
24 Weighted automata A non-deterministic Z-automaton is a 5-tuple A = (Σ, Q, δ, J, F), where: Σ = {a 1, a 2,..., a k } is a finite input alphabet and the letter a i is associated to a matrice M i Z n n ; Q = {1, 2,..., n} is the state set (and i corresponds to the ith row and column of the matrices); J is the set of initial states and F Q is the set of final states; δ is the set of transitions that provides the rules r (a i m) s, where a i Σ, and m = (M i ) rs is the multiplicity of the rule. A path ( b1 m π = s 1 ) ( b2 m 1 s 2 ) ( bt m 2 s 3 s t ) t s t+1 is a computation of the automaton A reading a word w = b 1 b 2... b t Σ and the muliplicity of this path is equal to π = m 1 m 2... m t Z.
25 Weighted automata For a word w Σ we denote by Π rs the set of the paths of A reading the word w which go from state r to state s. Then the multiplicity of the word w = a i1 a i2... a it Σ from r to s is the sum A rs (w) = π = (M i1 M i2... M it ) rs π Π rs and we get the multiplicity of w in A from the accepting paths: A(w) = A rs (w) = (M i1 M i2... M it ) rs. r J,s F r J,s F
26 Theorem Let T be a recursive theory in the language of set theory or T = PA. Then there exists a finite set of matrices M 1, M 2,..., M n Z 3 3, for some integer n 1, such that the subsemigroup of Z 3 3 generated by these matrices does not contain any matrix M with M 13 = 0 if and only if T is consistent.
27 Corollary There exists a finite set of matrices M 1, M 2,..., M n Z 3 3, for some integer n 1, such that: (1) the subsemigroup of Z 3 3 generated by these matrices does not contain any matrix M with M 13 = 0, and (2) The property (1) is not provable from PA. Corollary Let T be a recursive theory in the language of set theory or T = PA. Then there exists a 3-state Z-automaton A such that A accepts a word with multiplicity zero iff T is inconsistent.
28 Weighted automata ans Set Theory Corollary Let T be a recursive theory (in the language of set theory or T = PA). Then there exists two 2-state N-automata A and B such that A and B accept a word w with the same multiplicity iff T is inconsistent.
29 Weighted automata ans Set Theory Theorem Let T be a recursive theory in the language of set theory or T = PA. Then there exists a finite set of matrices M 1, M 2,..., M n Z 3 3, for some integer n 1, such that the subsemigroup of Z 3 3 generated by these matrices does not contain the zero matrix if and only if T is consistent.
30 Corollary For every integer p 0, there exists a finite set of matrices M 1, M 2,..., M np Z 3 3, for some integer n p 1, such that the subsemigroup of Z 3 3 generated by these matrices does not contain the zero matrix if and only if T p is consistent. In particular, if ZFC + There exist (at least) p inaccessible cardinals is consistent, then the property The subsemigroup of Z 3 3 generated by the matrices M 1, M 2,..., M np, does not contain the zero matrix is provable from ZFC + There exist (at least) p + 1 inaccessible cardinals but not from ZFC + There exist (at least) p inaccessible cardinals.
31 This could be compared to the fact that if PA (respectively, ZFC) is consistent then there is a polynomial P(x 1,..., x n ) which has no integer roots, but for which this cannot be proved from PA (respectively, ZFC); this result can be inferred from Matiyasevich s Theorem. See H.-D. Ebbinghaus, J. Flum, and W. Thomas. Mathematical logic. Undergraduate Texts in Mathematics. Springer-Verlag, New York, second edition, 1994.
32 Bibliography J. Berstel. Transductions and context free languages. Teubner Studienbücher Informatik, J. E. Hopcroft, R. Motwani, and J. D. Ullman. Introduction to automata theory, languages, and computation. Addison-Wesley Publishing Co., Reading, Mass., K. Gödel. On formally undecidable propositions of Principia Mathematica and related systems. Translated by B. Meltzer, with an introduction by R. B. Braithwaite. Basic Books, Inc., Publishers, New York, F.R. Drake. Set Theory, An Introduction to Large cardinals, volume 76 of Studies in Logic and the Foundations of Mathematics. North-Holland, A. Kanamori. The Higher Infinite. Springer-Verlag, 1997.
33 J. Hartmanis. Independence results about context-free languages and lower bounds. Information Processing Letters, 20(5): , D. Joseph and P. Young. Independence results in computer science? Journal of Computer and System Sciences, 23(2): , H.-D. Ebbinghaus, J. Flum, and W. Thomas. Mathematical logic. Undergraduate Texts in Mathematics. Springer-Verlag, New York, second edition, A. Horská. Where is the Gödel-point hiding: Gentzen s consistency proof of 1936 and his representation of constructive ordinals. Springer Briefs in Philosophy. Springer, Cham, 2014.
34 T. Harju. Decision questions on integer matrices. In Proceedings of the International Conference Developments in language theory (Vienna, 2001), volume 2295 of Lecture Notes in Computer Science, pages Springer, Berlin, V. Halava and T. Harju. Mortality in matrix semigroups. American Mathematical Monthly, 108(7): , 2001.
35 Conclusion 1 A great number of elementary properties of automata over finite words are actually independent from strong set theories. 2 One can effectively construct some automata, like 1-counter or 2-tape automata, for which many elementary properties reflect the scale of a hierarchy of large cardinals axioms like There exist (at least) n inaccessible cardinals for integers n 1. 3 We show how we can use Post Correspondence Problem to get simple combinatorial statements about finite words which are independent from strong set theories. 4 The results of this paper are true for other large cardinals than inaccessible ones. For instance we can replace inaccessible cardinals by hyperinaccessible, hypermahlo, measurable,... and still other ones and obtain similar results.
36 THANK YOU!
37
38
39 Consistency of theories and 1-counter automata Theorem (F. 2014) and there exists a real-time 1-counter Büchi automaton A T, reading words over a finite alphabet Γ, such that Cons(T ) is equivalent to each of the following items: (1 ) L(A T ) Γω ; (2 ) L(A T ) is not ω-regular; (3 ) L(A T ) is not deterministic; (4 ) L(A T ) is Σ1 1 -complete; (5 ) L(A T ) is not Borel; (6 ) L(A T ) is not in the Borel class Σ0 α (for a non-null countable ordinal α); (7 ) L(A T ) is not in the Borel class Π 0 α (for a non-null countable ordinal α); (8 ) L(A T ) is inherently ambiguous; (9 ) L(A T ) has the maximum degree of ambiguity (for acceptance by 1-counter automata or by Turing machines); (10 ) L(A T ) is not an arithmetical set; (11 ) L(A T ) is not an hyperarithmetical set; (12 ) L(A T ) is not in the arithmetical class Σ n (for n 1); (13 ) L(A T ) is not in the arithmetical class Π n (for n 1);
40 Consistency of theories and 1-counter automata T n : ZFC + There exist (at least) n inaccessible cardinals. We can apply the preceding theorem to the recursive theories T n, and get the real-time 1-counter Büchi automata A Tn and A T n, denoted A n and A n. Theorem (F. 2014) For every integer n 0, there exist two real-time 1-counter Büchi automata A n and A n, reading words over a finite alphabet Γ, such that Cons(T n ) is equivalent to each of the items (1)-(11) and (1 )-(13 ) of the preceding theorem where A T and A T are replaced by A n and A n. In particular, if ZFC + There exist (at least) n inaccessible cardinals is consistent, then each of the properties of A n and A n given by these items (1)-(11) and (1 )-(13 ) is provable from ZFC + There exist (at least) n + 1 inaccessible cardinals but not from ZFC + There exist (at least) n inaccessible cardinals.
41 Extensions There are similar results for: infinitary rational relations accepted by 2-tape Büchi automata. timed languages accepted by timed automata. Even in the finitary case, some similar results hold! The results of this paper are true for other large cardinals than inaccessible ones. For instance we can replace inaccessible cardinals by hyperinaccessible, Mahlo, hypermahlo, measurable, and still other ones and obtain similar results.
42 Extensions Same methods yield related results: we can construct, for a given theory T in the language of set theory and a given first-order sentence Φ in the language of set theory, a 1-counter Büchi automaton (or a 2-tape Büchi automaton) A 1 (respectively, A 2, A 3 ) such that L(A 1 ) (respectively, L(A 2 ), L(A 3 )) is Borel (and deterministic, ω-regular, unambiguous,... ) if and only if the sentence Φ is provable from T, (respectively, Φ is provable from T, Φ is independent from T ). Similar results hold for weaker arithmetical theories.
43 Extensions Example: P= NP can be expressed by a first-order sentence Ψ in the language of set theory. one can construct a 2-tape Büchi automaton A 1 (respectively, A 2, A 3 ) such that L(A 1 ) (respectively, L(A 2 ), L(A 3 )) is Borel if and only if the sentence Ψ is provable from T, (respectively, Ψ is provable from T, Ψ is independent from T ). Since the P= NP? problem is one of the millennium problems for the solution of which one million dollars is offered by the Clay Institute, this is the sum one can win by proving that the infinitary rational relation L(A 1 ) (or L(A 2 ) or L(A 3 )) is Borel!
44 Büchi acceptance condition An automaton A reading infinite words over the alphabet Σ is equipped with a finite set of states K and a set of final states F K. A run of A reading an infinite word σ Σ ω is said to be accepting iff there is some state q f F appearing infinitely often during the reading of σ. An infinite word σ Σ ω is accepted by A if there is (at least ) one accepting run of A on σ. An ω-language L Σ ω is accepted by A if it is the set of infinite words σ Σ ω accepted by A.
45 Context free or regular ω-languages ( Cohen and Gold 1977; Linna 1976 ) Let L Σ ω. Then the following propositions are equivalent : L is accepted by a Büchi pushdown automaton. L = 1 i n U i.v ω i, for some context free finitary languages U i and V i. L is a context free ω-language. A similar theorem holds if we: omit the pushdown stack and replace context free by regular, or replace pushdown and context-free by 1-counter.
46 Topological Complexity of ω-languages Non deterministic Büchi (or Muller) Turing machines accept effective analytic sets (Staiger). The class Effective-Σ 1 1 is the class of projections of arithmetical sets. There are some Σ 1 1-complete sets, hence in particular non-borel sets, in the class Effective-Σ 1 1. Theorem [Ressayre and F. 2003] There are some non-borel context-free (and even 1-counter) ω-languages. [F. 2005] 1-counter ω-languages have the same topological complexity as ω-languages accepted by non deterministic Büchi Turing machines.
47 Games with non-recursive strategies when they exist Theorem ( F ) There exists a 1-counter Büchi automaton A such that: (1) (ZFC+ ω L 1 < ω 1 ): Player 1 has a winning strategy σ in the game G(L(A)). But σ cannot be recursive and not even hyperarithmetical. (2) ( ZFC + ω L 1 = ω 1 ): the game G(L(A)) is not determined. Moreover these are the only two possibilities: there are no models of ZFC in which Player 2 has a winning strategy.
On Recognizable Languages of Infinite Pictures
On Recognizable Languages of Infinite Pictures Equipe de Logique Mathématique CNRS and Université Paris 7 JAF 28, Fontainebleau, Juin 2009 Pictures Pictures are two-dimensional words. Let Σ be a finite
More informationOn the Accepting Power of 2-Tape Büchi Automata
On the Accepting Power of 2-Tape Büchi Automata Equipe de Logique Mathématique Université Paris 7 STACS 2006 Acceptance of infinite words In the sixties, Acceptance of infinite words by finite automata
More informationOn Recognizable Languages of Infinite Pictures
On Recognizable Languages of Infinite Pictures Equipe de Logique Mathématique CNRS and Université Paris 7 LIF, Marseille, Avril 2009 Pictures Pictures are two-dimensional words. Let Σ be a finite alphabet
More informationThe exact complexity of the infinite Post Correspondence Problem
The exact complexity of the infinite Post Correspondence Problem Olivier Finkel To cite this version: Olivier Finkel. The exact complexity of the infinite Post Correspondence Problem. Information Processing
More informationarxiv: v2 [cs.lo] 26 Mar 2018
Wadge Degrees of ω-languages of Petri Nets Olivier Finkel Equipe de Logique Mathématique Institut de Mathématiques de Jussieu - Paris Rive Gauche CNRS et Université Paris 7, France. finkel@math.univ-paris-diderot.fr
More informationOn decision problems for timed automata
On decision problems for timed automata Olivier Finkel Equipe de Logique Mathématique, U.F.R. de Mathématiques, Université Paris 7 2 Place Jussieu 75251 Paris cedex 05, France. finkel@logique.jussieu.fr
More informationSet Theory and the Foundation of Mathematics. June 19, 2018
1 Set Theory and the Foundation of Mathematics June 19, 2018 Basics Numbers 2 We have: Relations (subsets on their domain) Ordered pairs: The ordered pair x, y is the set {{x, y}, {x}}. Cartesian products
More informationLocally Finite ω-languages and Effective Analytic Sets Have the Same Topological Complexity
Locally Finite ω-languages and Effective Analytic Sets Have the Same Topological Complexity Olivier Finkel To cite this version: Olivier Finkel. Locally Finite ω-languages and Effective Analytic Sets Have
More informationInformal Statement Calculus
FOUNDATIONS OF MATHEMATICS Branches of Logic 1. Theory of Computations (i.e. Recursion Theory). 2. Proof Theory. 3. Model Theory. 4. Set Theory. Informal Statement Calculus STATEMENTS AND CONNECTIVES Example
More informationWHY ISN T THE CONTINUUM PROBLEM ON THE MILLENNIUM ($1,000,000) PRIZE LIST?
WHY ISN T THE CONTINUUM PROBLEM ON THE MILLENNIUM ($1,000,000) PRIZE LIST? Solomon Feferman CSLI Workshop on Logic, Rationality and Intelligent Interaction Stanford, June 1, 2013 Why isn t the Continuum
More informationPart II. Logic and Set Theory. Year
Part II Year 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2018 60 Paper 4, Section II 16G State and prove the ǫ-recursion Theorem. [You may assume the Principle of ǫ- Induction.]
More informationAmbiguity of ω-languages of Turing Machines
Ambiguity of ω-languages of Turing Machines Olivier Finkel To cite this version: Olivier Finkel. Ambiguity of ω-languages of Turing Machines. Logical Methods in Computer Science, Logical Methods in Computer
More informationLarge Numbers, Busy Beavers, Noncomputability and Incompleteness
Large Numbers, Busy Beavers, Noncomputability and Incompleteness Food For Thought November 1, 2007 Sam Buss Department of Mathematics U.C. San Diego PART I Large Numbers, Busy Beavers, and Undecidability
More informationAMBIGUITY IN OMEGA CONTEXT FREE LANGUAGES
AMBIGUITY IN OMEGA CONTEXT FREE LANGUAGES Olivier Finkel Equipe de Logique Mathématique CNRS et Université Paris 7, U.F.R. de Mathématiques 2 Place Jussieu 75251 Paris cedex 05, France. Abstract We extend
More informationAn algebraic characterization of unary two-way transducers
An algebraic characterization of unary two-way transducers (Extended Abstract) Christian Choffrut 1 and Bruno Guillon 1 LIAFA, CNRS and Université Paris 7 Denis Diderot, France. Abstract. Two-way transducers
More informationDecidability: Church-Turing Thesis
Decidability: Church-Turing Thesis While there are a countably infinite number of languages that are described by TMs over some alphabet Σ, there are an uncountably infinite number that are not Are there
More informationProof Theory and Subsystems of Second-Order Arithmetic
Proof Theory and Subsystems of Second-Order Arithmetic 1. Background and Motivation Why use proof theory to study theories of arithmetic? 2. Conservation Results Showing that if a theory T 1 proves ϕ,
More informationFinite Automata Theory and Formal Languages TMV027/DIT321 LP4 2018
Finite Automata Theory and Formal Languages TMV027/DIT321 LP4 2018 Lecture 15 Ana Bove May 17th 2018 Recap: Context-free Languages Chomsky hierarchy: Regular languages are also context-free; Pumping lemma
More informationWhat are the recursion theoretic properties of a set of axioms? Understanding a paper by William Craig Armando B. Matos
What are the recursion theoretic properties of a set of axioms? Understanding a paper by William Craig Armando B. Matos armandobcm@yahoo.com February 5, 2014 Abstract This note is for personal use. It
More informationThe constructible universe
The constructible universe In this set of notes I want to sketch Gödel s proof that CH is consistent with the other axioms of set theory. Gödel s argument goes well beyond this result; his identification
More informationOn Decidability Properties of One-Dimensional Cellular Automata
On Decidability Properties of One-Dimensional Cellular Automata arxiv:0903.4615v1 [cs.lo] 26 Mar 2009 Olivier Finkel Equipe de Logique Mathématique CNRS et Université Paris 7, France. finkel@logique.jussieu.fr
More informationHandbook of Logic and Proof Techniques for Computer Science
Steven G. Krantz Handbook of Logic and Proof Techniques for Computer Science With 16 Figures BIRKHAUSER SPRINGER BOSTON * NEW YORK Preface xvii 1 Notation and First-Order Logic 1 1.1 The Use of Connectives
More informationIntroduction to Turing Machines
Introduction to Turing Machines Deepak D Souza Department of Computer Science and Automation Indian Institute of Science, Bangalore. 12 November 2015 Outline 1 Turing Machines 2 Formal definitions 3 Computability
More information258 Handbook of Discrete and Combinatorial Mathematics
258 Handbook of Discrete and Combinatorial Mathematics 16.3 COMPUTABILITY Most of the material presented here is presented in far more detail in the texts of Rogers [R], Odifreddi [O], and Soare [S]. In
More informationMonadic Second Order Logic and Automata on Infinite Words: Büchi s Theorem
Monadic Second Order Logic and Automata on Infinite Words: Büchi s Theorem R. Dustin Wehr December 18, 2007 Büchi s theorem establishes the equivalence of the satisfiability relation for monadic second-order
More informationTHE COMPLEXITY OF INFINITE COMPUTATIONS IN MODELS OF SET THEORY
Logical Methods in Computer Science Vol. 5 (4:4) 2009, pp. 1 18 www.lmcs-online.org Submitted Jan. 20, 2009 Published Dec. 21, 2009 THE COMPLEXITY OF INFINITE COMPUTATIONS IN MODELS OF SET THEORY OLIVIER
More informationOrdinalize! Peter Koepke University of Bonn January 28, Cantor s ordinals extend the standard natural numbers into the transfinite:
Ordinalize! Peter Koepke University of Bonn January 28, 2007 1 Introduction Cantor s ordinals extend the standard natural numbers into the transfinite: 0, 1, 2, 3,..., n, n + 1,... is continued by ω, ω
More informationModel Theory MARIA MANZANO. University of Salamanca, Spain. Translated by RUY J. G. B. DE QUEIROZ
Model Theory MARIA MANZANO University of Salamanca, Spain Translated by RUY J. G. B. DE QUEIROZ CLARENDON PRESS OXFORD 1999 Contents Glossary of symbols and abbreviations General introduction 1 xix 1 1.0
More informationOn Stateless Multicounter Machines
On Stateless Multicounter Machines Ömer Eğecioğlu and Oscar H. Ibarra Department of Computer Science University of California, Santa Barbara, CA 93106, USA Email: {omer, ibarra}@cs.ucsb.edu Abstract. We
More informationSYLLABUS. Introduction to Finite Automata, Central Concepts of Automata Theory. CHAPTER - 3 : REGULAR EXPRESSIONS AND LANGUAGES
Contents i SYLLABUS UNIT - I CHAPTER - 1 : AUT UTOMA OMATA Introduction to Finite Automata, Central Concepts of Automata Theory. CHAPTER - 2 : FINITE AUT UTOMA OMATA An Informal Picture of Finite Automata,
More informationHilbert s problems, Gödel, and the limits of computation
Hilbert s problems, Gödel, and the limits of computation Logan Axon Gonzaga University April 6, 2011 Hilbert at the ICM At the 1900 International Congress of Mathematicians in Paris, David Hilbert gave
More informationarxiv: v1 [math.lo] 7 Dec 2017
CANONICAL TRUTH MERLIN CARL AND PHILIPP SCHLICHT arxiv:1712.02566v1 [math.lo] 7 Dec 2017 Abstract. We introduce and study a notion of canonical set theoretical truth, which means truth in a transitive
More informationFrom Constructibility and Absoluteness to Computability and Domain Independence
From Constructibility and Absoluteness to Computability and Domain Independence Arnon Avron School of Computer Science Tel Aviv University, Tel Aviv 69978, Israel aa@math.tau.ac.il Abstract. Gödel s main
More informationINTRODUCTION TO CARDINAL NUMBERS
INTRODUCTION TO CARDINAL NUMBERS TOM CUCHTA 1. Introduction This paper was written as a final project for the 2013 Summer Session of Mathematical Logic 1 at Missouri S&T. We intend to present a short discussion
More informationUnsolvable problems, the Continuum Hypothesis, and the nature of infinity
Unsolvable problems, the Continuum Hypothesis, and the nature of infinity W. Hugh Woodin Harvard University January 9, 2017 V : The Universe of Sets The power set Suppose X is a set. The powerset of X
More informationGeneralizing Gödel s Constructible Universe:
Generalizing Gödel s Constructible Universe: Ultimate L W. Hugh Woodin Harvard University IMS Graduate Summer School in Logic June 2018 Ordinals: the transfinite numbers is the smallest ordinal: this is
More informationNONSTANDARD MODELS AND KRIPKE S PROOF OF THE GÖDEL THEOREM
Notre Dame Journal of Formal Logic Volume 41, Number 1, 2000 NONSTANDARD MODELS AND KRIPKE S PROOF OF THE GÖDEL THEOREM HILARY PUTNAM Abstract This lecture, given at Beijing University in 1984, presents
More informationLogic and Games SS 2009
Logic and Games SS 2009 Prof. Dr. Erich Grädel Łukasz Kaiser, Tobias Ganzow Mathematische Grundlagen der Informatik RWTH Aachen c b n d This work is licensed under: http://creativecommons.org/licenses/by-nc-nd/3.0/de/
More informationCS 275 Automata and Formal Language Theory
CS 275 Automata and Formal Language Theory Course Notes Part III: Limits of Computation Chapter III.1: Introduction Anton Setzer http://www.cs.swan.ac.uk/ csetzer/lectures/ automataformallanguage/current/index.html
More information185.A09 Advanced Mathematical Logic
185.A09 Advanced Mathematical Logic www.volny.cz/behounek/logic/teaching/mathlog13 Libor Běhounek, behounek@cs.cas.cz Lecture #1, October 15, 2013 Organizational matters Study materials will be posted
More informationOctober 12, Complexity and Absoluteness in L ω1,ω. John T. Baldwin. Measuring complexity. Complexity of. concepts. to first order.
October 12, 2010 Sacks Dicta... the central notions of model theory are absolute absoluteness, unlike cardinality, is a logical concept. That is why model theory does not founder on that rock of undecidability,
More information17.1 The Halting Problem
CS125 Lecture 17 Fall 2016 17.1 The Halting Problem Consider the HALTING PROBLEM (HALT TM ): Given a TM M and w, does M halt on input w? Theorem 17.1 HALT TM is undecidable. Suppose HALT TM = { M,w : M
More informationPREDICATE LOGIC: UNDECIDABILITY AND INCOMPLETENESS HUTH AND RYAN 2.5, SUPPLEMENTARY NOTES 2
PREDICATE LOGIC: UNDECIDABILITY AND INCOMPLETENESS HUTH AND RYAN 2.5, SUPPLEMENTARY NOTES 2 Neil D. Jones DIKU 2005 14 September, 2005 Some slides today new, some based on logic 2004 (Nils Andersen) OUTLINE,
More informationPart II Logic and Set Theory
Part II Logic and Set Theory Theorems Based on lectures by I. B. Leader Notes taken by Dexter Chua Lent 2015 These notes are not endorsed by the lecturers, and I have modified them (often significantly)
More informationTHE CANTOR GAME: WINNING STRATEGIES AND DETERMINACY. by arxiv: v1 [math.ca] 29 Jan 2017 MAGNUS D. LADUE
THE CANTOR GAME: WINNING STRATEGIES AND DETERMINACY by arxiv:170109087v1 [mathca] 9 Jan 017 MAGNUS D LADUE 0 Abstract In [1] Grossman Turett define the Cantor game In [] Matt Baker proves several results
More informationClassical Theory of Cardinal Characteristics
Classical Theory of Cardinal Characteristics Andreas Blass University of Michigan 22 August, 2018 Andreas Blass (University of Michigan) Classical Theory of Cardinal Characteristics 22 August, 2018 1 /
More informationProbabilistic Aspects of Computer Science: Probabilistic Automata
Probabilistic Aspects of Computer Science: Probabilistic Automata Serge Haddad LSV, ENS Paris-Saclay & CNRS & Inria M Jacques Herbrand Presentation 2 Properties of Stochastic Languages 3 Decidability Results
More informationFriendly Logics, Fall 2015, Lecture Notes 1
Friendly Logics, Fall 2015, Lecture Notes 1 Val Tannen 1 Some references Course Web Page: http://www.cis.upenn.edu/~val/cis682. I have posted there the remarkable On the Unusual Effectiveness of Logic
More informationAcceptance of!-languages by Communicating Deterministic Turing Machines
Acceptance of!-languages by Communicating Deterministic Turing Machines Rudolf Freund Institut für Computersprachen, Technische Universität Wien, Karlsplatz 13 A-1040 Wien, Austria Ludwig Staiger y Institut
More informationDOWNLOAD PDF FOR SET THEORY
Chapter 1 : Discrete Mathematics/Set theory - Wikibooks, open books for an open world Set theory is a branch of mathematical logic that studies sets, which informally are collections of theinnatdunvilla.comgh
More informationWADGE HIERARCHY OF OMEGA CONTEXT FREE LANGUAGES
WADGE HIERARCHY OF OMEGA CONTEXT FREE LANGUAGES Olivier Finkel Equipe de Logique Mathématique CNRS URA 753 et Université Paris 7 U.F.R. de Mathématiques 2 Place Jussieu 75251 Paris cedex 05, France. E
More informationConsistency, Optimality, and Incompleteness
Consistency, Optimality, and Incompleteness Yijia Chen Shanghai Jiaotong University, China Jörg Flum Albert-Ludwigs-Universität Freiburg, Germany Moritz Müller Kurt Gödel Research Center, University of
More informationAbout the relationship between formal logic and complexity classes
About the relationship between formal logic and complexity classes Working paper Comments welcome; my email: armandobcm@yahoo.com Armando B. Matos October 20, 2013 1 Introduction We analyze a particular
More informationEssential Background for Real Analysis I (MATH 5210)
Background Material 1 Essential Background for Real Analysis I (MATH 5210) Note. These notes contain several definitions, theorems, and examples from Analysis I (MATH 4217/5217) which you must know for
More informationLecture 14 Rosser s Theorem, the length of proofs, Robinson s Arithmetic, and Church s theorem. Michael Beeson
Lecture 14 Rosser s Theorem, the length of proofs, Robinson s Arithmetic, and Church s theorem Michael Beeson The hypotheses needed to prove incompleteness The question immediate arises whether the incompleteness
More informationHilbert s problems, Gödel, and the limits of computation
Hilbert s problems, Gödel, and the limits of computation Logan Axon Gonzaga University November 14, 2013 Hilbert at the ICM At the 1900 International Congress of Mathematicians in Paris, David Hilbert
More informationConsistency, Optimality, and Incompleteness
Consistency, Optimality, and Incompleteness Yijia Chen Shanghai Jiaotong University, China Jörg Flum Albert-Ludwigs-Universität Freiburg, Germany Moritz Müller Kurt Gödel Research Center, University of
More informationUndecidability. Andreas Klappenecker. [based on slides by Prof. Welch]
Undecidability Andreas Klappenecker [based on slides by Prof. Welch] 1 Sources Theory of Computing, A Gentle Introduction, by E. Kinber and C. Smith, Prentice-Hall, 2001 Automata Theory, Languages and
More informationLimits of Computability
Limits of Computability Wolfgang Schreiner Wolfgang.Schreiner@risc.jku.at Research Institute for Symbolic Computation (RISC) Johannes Kepler University, Linz, Austria http://www.risc.jku.at Wolfgang Schreiner
More informationTallness and Level by Level Equivalence and Inequivalence
Tallness and Level by Level Equivalence and Inequivalence Arthur W. Apter Department of Mathematics Baruch College of CUNY New York, New York 10010 USA and The CUNY Graduate Center, Mathematics 365 Fifth
More informationAC68 FINITE AUTOMATA & FORMULA LANGUAGES DEC 2013
Q.2 a. Prove by mathematical induction n 4 4n 2 is divisible by 3 for n 0. Basic step: For n = 0, n 3 n = 0 which is divisible by 3. Induction hypothesis: Let p(n) = n 3 n is divisible by 3. Induction
More informationCS 275 Automata and Formal Language Theory
CS 275 Automata and Formal Language Theory Course Notes Part III: Limits of Computation Chapt. III.1: Introduction Anton Setzer http://www.cs.swan.ac.uk/ csetzer/lectures/ automataformallanguage/current/index.html
More informationThe Absoluteness of Constructibility
Lecture: The Absoluteness of Constructibility We would like to show that L is a model of V = L, or, more precisely, that L is an interpretation of ZF + V = L in ZF. We have already verified that σ L holds
More informationWe will now make precise what is meant by a syntactic characterization of the set of arithmetically true sentences.
2.4 Incompleteness We will now make precise what is meant by a syntactic characterization of the set of arithmetically true sentences. Definition 2.15. A theory T is called axiomatisable if there is a
More informationAxiomatic set theory. Chapter Why axiomatic set theory?
Chapter 1 Axiomatic set theory 1.1 Why axiomatic set theory? Essentially all mathematical theories deal with sets in one way or another. In most cases, however, the use of set theory is limited to its
More informationMATH 3300 Test 1. Name: Student Id:
Name: Student Id: There are nine problems (check that you have 9 pages). Solutions are expected to be short. In the case of proofs, one or two short paragraphs should be the average length. Write your
More informationKvantifikator för en Dag
Philosophical Communications, Web Series, No. 35, pp. 155-162 Dept. of Philosophy, Göteborg University, Sweden ISSN 1652-0459 Kvantifikator för en Dag Essays dedicated to Dag Westerståhl on his sixtieth
More informationJónsson posets and unary Jónsson algebras
Jónsson posets and unary Jónsson algebras Keith A. Kearnes and Greg Oman Abstract. We show that if P is an infinite poset whose proper order ideals have cardinality strictly less than P, and κ is a cardinal
More informationFinal exam study sheet for CS3719 Turing machines and decidability.
Final exam study sheet for CS3719 Turing machines and decidability. A Turing machine is a finite automaton with an infinite memory (tape). Formally, a Turing machine is a 6-tuple M = (Q, Σ, Γ, δ, q 0,
More informationOn Rice s theorem. Hans Hüttel. October 2001
On Rice s theorem Hans Hüttel October 2001 We have seen that there exist languages that are Turing-acceptable but not Turing-decidable. An important example of such a language was the language of the Halting
More informationEffective Randomness and Continuous Measures
Effective Randomness and Continuous Measures Theodore A. Slaman (on joint work with Jan Reimann) C University of California, Berkeley Review Let NCR n be the set of X 2 2! such that there is no (representation
More informationHierarchy among Automata on Linear Orderings
Hierarchy among Automata on Linear Orderings Véronique Bruyère Institut d Informatique Université de Mons-Hainaut Olivier Carton LIAFA Université Paris 7 Abstract In a preceding paper, automata and rational
More informationDeterminacy of Infinitely Long Games
Determinacy of Infinitely Long Games Draft September 2018 Donald A. Martin The main subject of this book is games in which two players are given a set A of infinite sequences of natural numbers and take
More informationAmbiguity of omega-languages of Turing Machines
Ambiguity of omega-languages of Turing Machines Olivier Finkel To cite this version: Olivier Finkel. Ambiguity of omega-languages of Turing Machines. 2012. HAL Id: hal-00735050 https://hal.archives-ouvertes.fr/hal-00735050v1
More informationSets are one of the basic building blocks for the types of objects considered in discrete mathematics.
Section 2.1 Introduction Sets are one of the basic building blocks for the types of objects considered in discrete mathematics. Important for counting. Programming languages have set operations. Set theory
More informationSELF-DUAL UNIFORM MATROIDS ON INFINITE SETS
SELF-DUAL UNIFORM MATROIDS ON INFINITE SETS NATHAN BOWLER AND STEFAN GESCHKE Abstract. We extend the notion of a uniform matroid to the infinitary case and construct, using weak fragments of Martin s Axiom,
More informationThe Metamathematics of Randomness
The Metamathematics of Randomness Jan Reimann January 26, 2007 (Original) Motivation Effective extraction of randomness In my PhD-thesis I studied the computational power of reals effectively random for
More informationElementary Equivalence, Partial Isomorphisms, and. Scott-Karp analysis
Elementary Equivalence, Partial Isomorphisms, and Scott-Karp analysis 1 These are self-study notes I prepared when I was trying to understand the subject. 1 Elementary equivalence and Finite back and forth
More informationSection 14.1 Computability then else
Section 14.1 Computability Some problems cannot be solved by any machine/algorithm. To prove such statements we need to effectively describe all possible algorithms. Example (Turing machines). Associate
More informationFINITE MODEL THEORY (MATH 285D, UCLA, WINTER 2017) LECTURE NOTES IN PROGRESS
FINITE MODEL THEORY (MATH 285D, UCLA, WINTER 2017) LECTURE NOTES IN PROGRESS ARTEM CHERNIKOV 1. Intro Motivated by connections with computational complexity (mostly a part of computer scientice today).
More informationDO FIVE OUT OF SIX ON EACH SET PROBLEM SET
DO FIVE OUT OF SIX ON EACH SET PROBLEM SET 1. THE AXIOM OF FOUNDATION Early on in the book (page 6) it is indicated that throughout the formal development set is going to mean pure set, or set whose elements,
More informationDM17. Beregnelighed. Jacob Aae Mikkelsen
DM17 Beregnelighed Jacob Aae Mikkelsen January 12, 2007 CONTENTS Contents 1 Introduction 2 1.1 Operations with languages...................... 2 2 Finite Automata 3 2.1 Regular expressions/languages....................
More informationarxiv: v1 [math.lo] 14 Jul 2017
THE CLASSIFICATION OF COUNTABLE MODELS OF SET THEORY arxiv:1707.04660v1 [math.lo] 14 Jul 2017 JOHN CLEMENS, SAMUEL COSKEY, AND SAMUEL DWORETZKY ABSTRACT. We study the complexity of the classification problem
More informationOn the coinductive nature of centralizers
On the coinductive nature of centralizers Charles Grellois INRIA & University of Bologna Séminaire du LIFO Jan 16, 2017 Charles Grellois (INRIA & Bologna) On the coinductive nature of centralizers Jan
More information20 Ordinals. Definition A set α is an ordinal iff: (i) α is transitive; and. (ii) α is linearly ordered by. Example 20.2.
20 Definition 20.1. A set α is an ordinal iff: (i) α is transitive; and (ii) α is linearly ordered by. Example 20.2. (a) Each natural number n is an ordinal. (b) ω is an ordinal. (a) ω {ω} is an ordinal.
More informationPrimitive recursive functions: decidability problems
Primitive recursive functions: decidability problems Armando B. Matos October 24, 2014 Abstract Although every primitive recursive (PR) function is total, many problems related to PR functions are undecidable.
More informationSubsumption of concepts in FL 0 for (cyclic) terminologies with respect to descriptive semantics is PSPACE-complete.
Subsumption of concepts in FL 0 for (cyclic) terminologies with respect to descriptive semantics is PSPACE-complete. Yevgeny Kazakov and Hans de Nivelle MPI für Informatik, Saarbrücken, Germany E-mail:
More informationSome decision problems on integer matrices
Some decision problems on integer matrices Christian Choffrut L.I.A.F.A, Université Paris VII, Tour 55-56, 1 er étage, 2 pl. Jussieu 75 251 Paris Cedex France Christian.Choffrut@liafa.jussieu.fr Juhani
More informationPeano Arithmetic. CSC 438F/2404F Notes (S. Cook) Fall, Goals Now
CSC 438F/2404F Notes (S. Cook) Fall, 2008 Peano Arithmetic Goals Now 1) We will introduce a standard set of axioms for the language L A. The theory generated by these axioms is denoted PA and called Peano
More informationα-recursion Theory and Ordinal Computability
α-recursion Theory and Ordinal Computability by Peter Koepke University of Bonn 1 3. 2. 2007 Abstract Motivated by a talk of S. D. Friedman at BIWOC we show that the α-recursive and α-recursively enumerable
More informationAutomata & languages. A primer on the Theory of Computation. Laurent Vanbever. ETH Zürich (D-ITET) October,
Automata & languages A primer on the Theory of Computation Laurent Vanbever www.vanbever.eu ETH Zürich (D-ITET) October, 19 2017 Part 5 out of 5 Last week was all about Context-Free Languages Context-Free
More informationA Natural Model of the Multiverse Axioms
Notre Dame Journal of Formal Logic Volume 51, Number 4, 2010 A Natural Model of the Multiverse Axioms Victoria Gitman and Joel David Hamkins Abstract If ZFC is consistent, then the collection of countable
More informationSingular Failures of GCH and Level by Level Equivalence
Singular Failures of GCH and Level by Level Equivalence Arthur W. Apter Department of Mathematics Baruch College of CUNY New York, New York 10010 USA and The CUNY Graduate Center, Mathematics 365 Fifth
More information2.2 Lowenheim-Skolem-Tarski theorems
Logic SEP: Day 1 July 15, 2013 1 Some references Syllabus: http://www.math.wisc.edu/graduate/guide-qe Previous years qualifying exams: http://www.math.wisc.edu/ miller/old/qual/index.html Miller s Moore
More information6.8 The Post Correspondence Problem
6.8. THE POST CORRESPONDENCE PROBLEM 423 6.8 The Post Correspondence Problem The Post correspondence problem (due to Emil Post) is another undecidable problem that turns out to be a very helpful tool for
More informationMAGIC Set theory. lecture 2
MAGIC Set theory lecture 2 David Asperó University of East Anglia 22 October 2014 Recall from last time: Syntactical vs. semantical logical consequence Given a set T of formulas and a formula ', we write
More informationThe purpose here is to classify computational problems according to their complexity. For that purpose we need first to agree on a computational
1 The purpose here is to classify computational problems according to their complexity. For that purpose we need first to agree on a computational model. We'll remind you what a Turing machine is --- you
More informationcse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska
cse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska LECTURE 1 Course Web Page www3.cs.stonybrook.edu/ cse303 The webpage contains: lectures notes slides; very detailed solutions to
More informationINDEPENDENCE OF THE CONTINUUM HYPOTHESIS
INDEPENDENCE OF THE CONTINUUM HYPOTHESIS CAPSTONE MATT LUTHER 1 INDEPENDENCE OF THE CONTINUUM HYPOTHESIS 2 1. Introduction This paper will summarize many of the ideas from logic and set theory that are
More informationOpleiding Informatica
Opleiding Informatica Tape-quantifying Turing machines in the arithmetical hierarchy Simon Heijungs Supervisors: H.J. Hoogeboom & R. van Vliet BACHELOR THESIS Leiden Institute of Advanced Computer Science
More information