# On strong fairness in UNITY

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 On strong fairness in UNITY H.P.Gumm, D.Zhukov Fachbereich Mathematik und Informatik Philipps Universität Marburg Abstract. In [6] Tsay and Bagrodia present a correct and complete proof rule for proving within UNITY statements of the form (true p) (true q). Their result is obtained by specializing a proof rule due to Manna and Pnueli [5] and translating premises and conclusions into the UNITY framework. However, specializing the rule from [5] is not sufficient, details of the proof have to be invoked and modified. Here we give a straightforward and selfcontained proof of a rule that is more general in several respects. Firstly, our transition systems may have an infinite number of transitions, and secondly, p and q may be any temporal properties, as long as p is observable and q is bounded. In particular, temporal properties such as Enabled i T aken i, in which T aken i is not naturally a state property, can be dealt with. Our main tool is a predicate transformer w(p,q) that specializes to the well known wlt(q) for p = true. 1 Definitions 1.1 Transition systems Let G = (S, I, T ) be a transition system, i.e. S is a nonempty set, I S, and T a set of binary relations on S. Elements of S are called states, I is the set of initial states and each t T is called a transition. We allow T to be countably infinite. For any X S and t T we set t(x) := {s S x X.(x, s) t}. We assume that every transition is left total, that is for every s S and t T there exists an s with (s, s ) t. G, S, I, and T will remain fixed for the rest of this article. 1.2 Sequences, properties and temporal operators If σ is any sequence of elements of S, we denote its i-th element by σ i and its k-th rest by σ k. Thus σ = (σ 0, σ 1,...) and σ k = (σ k, σ k+1,...). Each initial segment u = (σ 0,..., σ k ) is called a prefix of σ. In this case we write u σ. Let S be the set of all finite and S ω the set of all infinite sequences over S. Let S = S S ω. Given U S and V S, U V consists of all concatenations u v with u U and v V. S k is the set of all sequences of length k over S. We identify S 1 with S.

2 A state property p is a subset of S and a temporal property P is a subset of S ω. Although we do not require that properties be presented syntactically, we prefer to use the familiar logical connectives over the set theoretic operations. Let P S, and Q S ω. The linear temporal connectives Init,,, and are defined as follows: Definition 1 Temporal Operators. Init(P ) = P S ω Q = S Q Q = S Q Q = S n Q The operator Init is usually dropped, that is if we use some P S as a temporal property, we actually mean Init(P ). Definition 2 observable, safety, bounded. A temporal property P is called observable if there exists a subset P 0 S such that P = P 0 S ω. P is called safety if its complement is observable. We call P bounded, if for some k there exists P 0 S k so that P = P 0 S ω. The above notion of safety agrees with the one introduced and investigated by Alpern and Schneider in [1]. Note that a bounded property is an observable safety property. If S is finite, the converse is also true. n=0 1.3 Paths, traces, weak fairness A path of the transition system G is a sequence σ S ω such that (σ i, σ i+1 ) T for all i ω. σ is called weak fair, if for every t T and every i ω there exists a j i with (σ j, σ j+1 ) t. In short: every transition of T is taken infinitely often. With ST ω we denote the set of all weak fair paths of G = (S, I, T ). If P is a temporal property and σ S ω we sometimes say σ satisfies P for σ P. A path α with α 0 I is called a trace of G. For a transition system G we write G = P and say G satisfies P, if every weak fair trace of G satisfies P, that is if I S ω ST ω P. In the following we shall use the letters u, v, w for elements (words) of S, p, q for state properties, P, Q, R for subsets of S or of S ω, σ, τ for paths and α, β, γ for traces of G. All paths and traces that we consider will be assumed to be weak fair with respect to T. 1.4 UNITY UNITY is a methodology for the specification and verification of transition systems. In K.M. Chandy and J. Misra s original presentation [2], T consists of

3 a finite set of conditional parallel assignments, thus, in particular, transitions are deterministic. UNITY logic is not quite a subset of temporal logic. Given state properties p and q, the following are UNITY properties together with their semantically equivalent temporal logic counterparts : initially p := Init(p) (1) invariant p := p (2) p unless q := ((p q) (p q)) (3) p q := (p q) (4) The operator, pronounced leads to, is the main connective for expressing progress. Its proof theory is based on an operator ensures which describes how progress is achieved with a single transition: p ensures q := (p unless q) t T. t(p q) q. p ensures q is not a temporal property, since it is easy to come up with transition systems G and G having the same weakly fair traces but different ensuresproperties. The above definition of the UNITY operators is purely extensional. In contrast to this, Chandy and Misra [2] introduce the UNITY operators via proof rules. The rules for are : p ensures q p q p q, q r p r k K.(p k q) ( k K.p k ) q In [3] and [4] it has been shown that these rules are correct and complete with respect to the above extensional definition of. In particular, the statement infinitely often p ( p) can be expressed in UNITY as true p. The above definitions of UNITY properties invariant, unless and, can straightforwardly be extended to the case where p and q are arbitrary temporal properties; initially p can be extended to the case where p S. Thus P is observable iff P = initially P 0 for some P 0 S. 2 Rules for conditional progress Conditional properties provide an extension of UNITY logic useful for describing properties of components within a given context. Y.-K. Tsay and R.L. Bagrodia argue in [6] that strong fairness can be expressed within UNITY using temporal properties of the form (true p) (true q) where p and q are state properties. The main result of their paper is a sound and complete rule for proving temporal properties of this form: Theorem 3 Tsay, Bagrodia. With some map M from S into a wellfounded partial order (W, ), the following is a sound and complete rule for proving statements of the form (true p) (true q) in UNITY : M r unless q p (M = r) (M r) q (true p) (true q)

4 Tsay and Bagrodia s proof invokes a sound and complete proof rule given by Manna and Pnueli in [5] for proving statements of the form [(r p) q]. When this rule is specialized to the case at hand, they show that all premises may be transformed into UNITY expressions. Unfortunately though, applying Manna and Pnueli s rule is not enough. The argument in [6] requires to invoke and modify details of Manna and Pnueli s proof, thus making the paper not selfcontained. Secondly, the type of temporal property commonly used to specify strong fairness for a transition t, Enabled t T aken t, does not immediately fit the above framework, since T aken t is not a state property, but rather a property of consecutive pairs of states. In fact, written as a temporal property, T aken t = t S ω. Finally, Manna and Pnueli s proof on which Theorem 1 is based, works only for transition systems with finitely many transitions. We shall therefore generalize the above to the following: Theorem 4. Let P be observable and Q = Q 0 S ω bounded with Q 0 S k. With some map M from S k into some wellfounded partial order (W, ) the following rule is correct and complete: M r unless q P (M = r) (M r) Q P Q As a special case we consider state properties p 1,..., p n together with the condition true p 1... true p n. This is equivalent to P where P is the observable property P = p 1 S p 2... S p n S ω. A slight modification of the general proof is needed to yield the following corollary: Corollary 5. With a map M from S into some wellfounded partial order ( W, ) and a map ξ : W {1,..., n} the following rule is correct and complete: M r unless q p ξ(r) ( M = r) ( M r) q (true p 1... true p n ) (true q) 2.1 Weak temporal implication The main tool in our proof is an operator w(, ) which is a weak form of a temporal implication. Definition 6. Let P S and Q S k then w(p, Q) := {u S k σ S ω T.σ Init(u) P σ Q}.

5 Note that for p = true, w(p, q) specializes to the well known weakest-leads-to, wlt(q). Moreover, the operator w(, ) is monotone in the second and antitone in the first argument. The following properties will be of relevance in this note: Lemma 7. w(p,q) satisfies: (i) w(p, Q) Q (ii) w(p, Q) unless Q (iii) P w(p, Q) Q Proof: For (i), let u Q. If σ Init(u), then σ Q. Hence u w(p, Q). For (ii), let σ = w(p, Q) Q, thus (σ 0,..., σ k 1 ) w(p, Q) Q. We need to show σ 1 = w(p, Q), i.e. (σ 1,..., σ k ) w(p, Q). So let τ ST ω be a path with (σ 1,..., σ k ) τ and τ = P. Then σ 0 τ is also a path from ST ω, satisfying P, hence σ 0 τ = Q. But (σ 0,..., σ k 1 ) σ 0 τ, so σ 0 τ = Q, hence τ = Q. For (iii), suppose σ = P w(p, Q), then u σ for some u w(p, Q). Then σ = P, so by definition of w(p, Q), σ = Q. Lemma 8. If G = P Q, then for every R Q with w(p, R) = R we have G = R. Proof: Assume, R Q with w(p, R) = R is given, but G = R. For any chosen map φ : ω T we show how to construct a trace such that for all i 0 α = w 0 u 0 w 1 u u i S k R 2. u i w i+1 u i+1 contains no subword from Q 3. u i w i+1 contains a subword from P 4. w i+1 contains a transition from φ(i + 1) From 4. and 3. it will follow that α can be constructed as a weak fair trace satisfying P. From 1. and 2. and the fact that Q R S k it follows that u 0 w 1 u 1 w 2... = Q, hence α = Q, contradicting the assumption G = P Q. Let us now begin constructing α. From the assumption G = R, we obtain a weak fair trace w 0 u 0 σ with u 0 S k R. Assume now that for some n 0 we have already found a path σ = u 0 w 1 u 1... w n u n τ such that 1. through 4. are satisfied for 0 i n. We shall show how to construct w n+1 u n+1. From u n S k R, we get u n S k w(p, R), so we can find a weak fair path σ with u n σ, σ = P and σ = R. This permits us to choose a prefix v n+1 = u n w n+1 σ large enough so that

6 v n+1 contains a subword p n+1 P w n+1 contains a transition from φ(n + 1). Let now u n+1 be the word consisting of the k subsequent letters of σ, i.e. such that u n w n+1 u n+1 σ. Then follow from the inductive assumption and from the fact that σ = R and from R Q. 4. is part of the construction of w n+1. We note in passing, that the converse of this lemma is also true. To show this, consider w (P, Q) := {u S k σ S ω T.σ Init(u) P σ Q}. It is easy to verify that R = w (P, Q) is a fixed point of the map w(p, ) containing Q. From G = R it follows G = P Q. 2.2 Measuring progress The above fixed point of w(p, ) can also be constructed by a transfinite iteration: M 0 = Q M α+1 = w(p, M α ), and M β = w(p, M α ), if β is a limit ordinal. α β We now turn to the proof of theorem 2. Correctness of the rule is easy and left to the reader. Let W = {α Ord β α.m α M β } M(u) = min{α W u M α } Note that M(u) will always be 0 or a successor ordinal. Assuming G = P Q, Lemma 2 yields that the above map M : S k γ is well defined on the reachable part of S k, that is on all k-tuples u for which there exists a weak fair trace σ, containing u as a subword. For all other k-tuples of S k, M may be defined arbitrarily, say 0. We have to show that for any ordinal r W the premises of the rule in theorem 2 are true. We use ordinal induction to show M r unless Q. The case r = 0 is trivial, since M 0 = Q. Suppose the claim is true for all α r. If r = α+1 then M r = w(p, M α ) and M r unless M α by lemma 1. Since M r M α Q and by induction hypothesis, we get M r unless Q, that is M r unless Q. The premise P M r M r Q is similarly shown by induction. M 0 = Q, so P M 0 Q. If r = α + 1 then P M r = P w(p, M α ) and the statement follows from Lemma 2(iii). Finally, we indicate how to modify M to yield the corollary. We have to measure the progress of the individual state properties p i on those subsets of S where M is constant. For s M α+1 M α we therefore define ξ(s) := max{j s w(p j S... S p n S ω, M α )}.

7 Let N = {1,..., n}. We consider W = W N with the lexicographic order and define M(s) = (M(s), ξ(s)) and ξ : W N as the second projection. With this it is straightforward to verify the corollary. 3 Conclusion We have given a correct and complete rule for temporal properties of the form P Q when P and Q are temporal properties with P observable and Q bounded. In comparison with a corresponding result by Tsay and Bagrodia for state properties p and q, our proof is selfcontained, and our results are more general in two ways: Firstly, we can deal with transition systems having an infinite number of transitions, and secondly, we can deal with more general types of temporal properties. References 1. B. Alpern, F.B. Schneider, Defining Liveness, Inform. Process. Lett. 21 (1985) K.M. Chandy,J. Misra. Parallel Program Design. Addison Wesley Co., Inc., Reading, Mass, C.S. Jutla, E. Knapp, J.R. Rao, A predicate transformer approach to semantics of parallel programs, Proc. 8th Annual ACM Symp. on Principles of Distributed Computing, Edmonton, Alberta J. Pachl. Three definitions of leads-to for UNITY. In Notes on UNITY: 23:90. Department of Computer Sciences, The University of Texas at Austin. 5. Z. Manna, A. Pnueli. Completing the temporal picture. Theoretical Computer Science 83 (1991) Y.-K- Tsay, R.L. Bagrodia. Deducing Fairness Properties in UNITY Logic A New Completeness Result. ACM Transactions on Programming Languages and Systems17 (1995) This article was processed using the L A TEX macro package with LLNCS style

### This asserts two sets are equal iff they have the same elements, that is, a set is determined by its elements.

3. Axioms of Set theory Before presenting the axioms of set theory, we first make a few basic comments about the relevant first order logic. We will give a somewhat more detailed discussion later, but

### CHAPTER 7 GENERAL PROOF SYSTEMS

CHAPTER 7 GENERAL PROOF SYSTEMS 1 Introduction Proof systems are built to prove statements. They can be thought as an inference machine with special statements, called provable statements, or sometimes

### 1 Definition of a Turing machine

Introduction to Algorithms Notes on Turing Machines CS 4820, Spring 2012 April 2-16, 2012 1 Definition of a Turing machine Turing machines are an abstract model of computation. They provide a precise,

### Lecture 2: Universality

CS 710: Complexity Theory 1/21/2010 Lecture 2: Universality Instructor: Dieter van Melkebeek Scribe: Tyson Williams In this lecture, we introduce the notion of a universal machine, develop efficient universal

### Topology and Convergence by: Daniel Glasscock, May 2012

Topology and Convergence by: Daniel Glasscock, May 2012 These notes grew out of a talk I gave at The Ohio State University. The primary reference is [1]. A possible error in the proof of Theorem 1 in [1]

### THE SEARCH FOR NATURAL DEFINABILITY IN THE TURING DEGREES

THE SEARCH FOR NATURAL DEFINABILITY IN THE TURING DEGREES ANDREW E.M. LEWIS 1. Introduction This will be a course on the Turing degrees. We shall assume very little background knowledge: familiarity with

### Turing Degrees and Definability of the Jump. Theodore A. Slaman. University of California, Berkeley. CJuly, 2005

Turing Degrees and Definability of the Jump Theodore A. Slaman University of California, Berkeley CJuly, 2005 Outline Lecture 1 Forcing in arithmetic Coding and decoding theorems Automorphisms of countable

### Math 421, Homework #5 Solutions

Math 421, Homework #5 Solutions (1) (8.3.6) Suppose that E R n and C is a subset of E. (a) Prove that if E is closed, then C is relatively closed in E if and only if C is a closed set (as defined in Definition

### MATHS 315 Mathematical Logic

MATHS 315 Mathematical Logic Second Semester, 2006 Contents 2 Formal Statement Logic 1 2.1 Post production systems................................. 1 2.2 The system L.......................................

### Chapter 1. Sigma-Algebras. 1.1 Definition

Chapter 1 Sigma-Algebras 1.1 Definition Consider a set X. A σ algebra F of subsets of X is a collection F of subsets of X satisfying the following conditions: (a) F (b) if B F then its complement B c is

### Logic & Discrete Math in Software Engineering (CAS 701) Dr. Borzoo Bonakdarpour

Logic & Discrete Math in Software Engineering (CAS 701) Background Dr. Borzoo Bonakdarpour Department of Computing and Software McMaster University Dr. Borzoo Bonakdarpour Logic & Discrete Math in SE (CAS

### Monitoring Metric First-order Temporal Properties

Monitoring Metric First-order Temporal Properties DAVID BASIN, FELIX KLAEDTKE, SAMUEL MÜLLER, and EUGEN ZĂLINESCU, ETH Zurich Runtime monitoring is a general approach to verifying system properties at

### TREES IN SET THEORY SPENCER UNGER

TREES IN SET THEORY SPENCER UNGER 1. Introduction Although I was unaware of it while writing the first two talks, my talks in the graduate student seminar have formed a coherent series. This talk can be

### A Mathematical Toolkit

A Mathematical Toolkit Philosophy 389 1 Naive Set Theory Cantor, in his 1895 work Contributions to the Founding of the Theory of Transfinite Numbers, gives the following definition of a set: By a set [Menge]

### Finite Sets. Theorem 5.1. Two non-empty finite sets have the same cardinality if and only if they are equivalent.

MATH 337 Cardinality Dr. Neal, WKU We now shall prove that the rational numbers are a countable set while R is uncountable. This result shows that there are two different magnitudes of infinity. But we

### 6.2 Permutations continued

6.2 Permutations continued Theorem A permutation on a finite set A is either a cycle or can be expressed as a product (composition of disjoint cycles. Proof is by (strong induction on the number, r, of

### Section 3 Sequences and Limits, Continued.

Section 3 Sequences and Limits, Continued. Lemma 3.6 Let {a n } n N be a convergent sequence for which a n 0 for all n N and it α 0. Then there exists N N such that for all n N. α a n 3 α In particular

### A NOTE ON INITIAL SEGMENTS OF THE ENUMERATION DEGREES

A NOTE ON INITIAL SEGMENTS OF THE ENUMERATION DEGREES THEODORE A. SLAMAN AND ANDREA SORBI Abstract. We show that no nontrivial principal ideal of the enumeration degrees is linearly ordered: In fact, below

### Recursion Theory in Set Theory

Contemporary Mathematics Recursion Theory in Set Theory Theodore A. Slaman 1. Introduction Our goal is to convince the reader that recursion theoretic knowledge and experience can be successfully applied

### n k=1 k=0 1/k! = e. Example 6.4. The series 1/k 2 converges in R. Indeed, if s n = n then k=1 1/k, then s 2n s n = 1 n + 1 +...

6 Series We call a normed space (X, ) a Banach space provided that every Cauchy sequence (x n ) in X converges. For example, R with the norm = is an example of Banach space. Now let (x n ) be a sequence

### CS 598CSC: Combinatorial Optimization Lecture date: 2/4/2010

CS 598CSC: Combinatorial Optimization Lecture date: /4/010 Instructor: Chandra Chekuri Scribe: David Morrison Gomory-Hu Trees (The work in this section closely follows [3]) Let G = (V, E) be an undirected

### 13 Infinite Sets. 13.1 Injections, Surjections, and Bijections. mcs-ftl 2010/9/8 0:40 page 379 #385

mcs-ftl 2010/9/8 0:40 page 379 #385 13 Infinite Sets So you might be wondering how much is there to say about an infinite set other than, well, it has an infinite number of elements. Of course, an infinite

### Discrete Mathematics, Chapter 5: Induction and Recursion

Discrete Mathematics, Chapter 5: Induction and Recursion Richard Mayr University of Edinburgh, UK Richard Mayr (University of Edinburgh, UK) Discrete Mathematics. Chapter 5 1 / 20 Outline 1 Well-founded

### Automata on Infinite Words and Trees

Automata on Infinite Words and Trees Course notes for the course Automata on Infinite Words and Trees given by Dr. Meghyn Bienvenu at Universität Bremen in the 2009-2010 winter semester Last modified:

### (IALC, Chapters 8 and 9) Introduction to Turing s life, Turing machines, universal machines, unsolvable problems.

3130CIT: Theory of Computation Turing machines and undecidability (IALC, Chapters 8 and 9) Introduction to Turing s life, Turing machines, universal machines, unsolvable problems. An undecidable problem

### A NEW CONDENSATION PRINCIPLE

A NEW CONDENSATION PRINCIPLE THORALF RÄSCH AND RALF SCHINDLER Abstract. We generalize (A), which was introduced in [Sch ], to larger cardinals. For a regular cardinal κ > ℵ 0 we denote by κ (A) the statement

### The Halting Problem is Undecidable

185 Corollary G = { M, w w L(M) } is not Turing-recognizable. Proof. = ERR, where ERR is the easy to decide language: ERR = { x { 0, 1 }* x does not have a prefix that is a valid code for a Turing machine

### Section 3 Sequences and Limits

Section 3 Sequences and Limits Definition A sequence of real numbers is an infinite ordered list a, a 2, a 3, a 4,... where, for each n N, a n is a real number. We call a n the n-th term of the sequence.

### Our goal first will be to define a product measure on A 1 A 2.

1. Tensor product of measures and Fubini theorem. Let (A j, Ω j, µ j ), j = 1, 2, be two measure spaces. Recall that the new σ -algebra A 1 A 2 with the unit element is the σ -algebra generated by the

### ω-automata Automata that accept (or reject) words of infinite length. Languages of infinite words appear:

ω-automata ω-automata Automata that accept (or reject) words of infinite length. Languages of infinite words appear: in verification, as encodings of non-terminating executions of a program. in arithmetic,

### 4 Domain Relational Calculus

4 Domain Relational Calculus We now present two relational calculi that we will compare to RA. First, what is the difference between an algebra and a calculus? The usual story is that the algebra RA is

### No: 10 04. Bilkent University. Monotonic Extension. Farhad Husseinov. Discussion Papers. Department of Economics

No: 10 04 Bilkent University Monotonic Extension Farhad Husseinov Discussion Papers Department of Economics The Discussion Papers of the Department of Economics are intended to make the initial results

### Fairness in Routing and Load Balancing

Fairness in Routing and Load Balancing Jon Kleinberg Yuval Rabani Éva Tardos Abstract We consider the issue of network routing subject to explicit fairness conditions. The optimization of fairness criteria

### Problem Set. Problem Set #2. Math 5322, Fall December 3, 2001 ANSWERS

Problem Set Problem Set #2 Math 5322, Fall 2001 December 3, 2001 ANSWERS i Problem 1. [Problem 18, page 32] Let A P(X) be an algebra, A σ the collection of countable unions of sets in A, and A σδ the collection

### GROUPS SUBGROUPS. Definition 1: An operation on a set G is a function : G G G.

Definition 1: GROUPS An operation on a set G is a function : G G G. Definition 2: A group is a set G which is equipped with an operation and a special element e G, called the identity, such that (i) the

### Math 317 HW #7 Solutions

Math 17 HW #7 Solutions 1. Exercise..5. Decide which of the following sets are compact. For those that are not compact, show how Definition..1 breaks down. In other words, give an example of a sequence

### 4.6 The Primitive Recursive Functions

4.6. THE PRIMITIVE RECURSIVE FUNCTIONS 309 4.6 The Primitive Recursive Functions The class of primitive recursive functions is defined in terms of base functions and closure operations. Definition 4.6.1

### Solutions to Tutorial 2 (Week 3)

THE UIVERSITY OF SYDEY SCHOOL OF MATHEMATICS AD STATISTICS Solutions to Tutorial 2 (Week 3) MATH3969: Measure Theory and Fourier Analysis (Advanced) Semester 2, 2016 Web Page: http://sydney.edu.au/science/maths/u/ug/sm/math3969/

### An example of a computable

An example of a computable absolutely normal number Verónica Becher Santiago Figueira Abstract The first example of an absolutely normal number was given by Sierpinski in 96, twenty years before the concept

### MAT2400 Analysis I. A brief introduction to proofs, sets, and functions

MAT2400 Analysis I A brief introduction to proofs, sets, and functions In Analysis I there is a lot of manipulations with sets and functions. It is probably also the first course where you have to take

### Degrees that are not degrees of categoricity

Degrees that are not degrees of categoricity Bernard A. Anderson Department of Mathematics and Physical Sciences Gordon State College banderson@gordonstate.edu www.gordonstate.edu/faculty/banderson Barbara

### Categoricity transfer in Simple Finitary Abstract Elementary Classes

Categoricity transfer in Simple Finitary Abstract Elementary Classes Tapani Hyttinen and Meeri Kesälä August 15, 2008 Abstract We continue to study nitary abstract elementary classes, dened in [7]. We

### 1. Prove that the empty set is a subset of every set.

1. Prove that the empty set is a subset of every set. Basic Topology Written by Men-Gen Tsai email: b89902089@ntu.edu.tw Proof: For any element x of the empty set, x is also an element of every set since

### Virtual Time and Timeout in Client-Server Networks

Virtual Time and Timeout in Client-Server Networks Jayadev Misra July 13, 2011 Contents 1 Introduction 2 1.1 Background.............................. 2 1.1.1 Causal Model of Virtual Time...............

### CARDINALITY, COUNTABLE AND UNCOUNTABLE SETS PART ONE

CARDINALITY, COUNTABLE AND UNCOUNTABLE SETS PART ONE With the notion of bijection at hand, it is easy to formalize the idea that two finite sets have the same number of elements: we just need to verify

### THE TURING DEGREES AND THEIR LACK OF LINEAR ORDER

THE TURING DEGREES AND THEIR LACK OF LINEAR ORDER JASPER DEANTONIO Abstract. This paper is a study of the Turing Degrees, which are levels of incomputability naturally arising from sets of natural numbers.

### INCIDENCE-BETWEENNESS GEOMETRY

INCIDENCE-BETWEENNESS GEOMETRY MATH 410, CSUSM. SPRING 2008. PROFESSOR AITKEN This document covers the geometry that can be developed with just the axioms related to incidence and betweenness. The full

### Course 221: Analysis Academic year , First Semester

Course 221: Analysis Academic year 2007-08, First Semester David R. Wilkins Copyright c David R. Wilkins 1989 2007 Contents 1 Basic Theorems of Real Analysis 1 1.1 The Least Upper Bound Principle................

### WEAK DOMINANCE: A MYSTERY CRACKED

WEAK DOMINANCE: A MYSTERY CRACKED JOHN HILLAS AND DOV SAMET Abstract. What strategy profiles can be played when it is common knowledge that weakly dominated strategies are not played? A comparison to the

### Chapter 6 Finite sets and infinite sets. Copyright 2013, 2005, 2001 Pearson Education, Inc. Section 3.1, Slide 1

Chapter 6 Finite sets and infinite sets Copyright 013, 005, 001 Pearson Education, Inc. Section 3.1, Slide 1 Section 6. PROPERTIES OF THE NATURE NUMBERS 013 Pearson Education, Inc.1 Slide Recall that denotes

### Correspondence analysis for strong three-valued logic

Correspondence analysis for strong three-valued logic A. Tamminga abstract. I apply Kooi and Tamminga s (2012) idea of correspondence analysis for many-valued logics to strong three-valued logic (K 3 ).

### Structure of Measurable Sets

Structure of Measurable Sets In these notes we discuss the structure of Lebesgue measurable subsets of R from several different points of view. Along the way, we will see several alternative characterizations

### DEGREES OF CATEGORICITY AND THE HYPERARITHMETIC HIERARCHY

DEGREES OF CATEGORICITY AND THE HYPERARITHMETIC HIERARCHY BARBARA F. CSIMA, JOHANNA N. Y. FRANKLIN, AND RICHARD A. SHORE Abstract. We study arithmetic and hyperarithmetic degrees of categoricity. We extend

### EMBEDDING COUNTABLE PARTIAL ORDERINGS IN THE DEGREES

EMBEDDING COUNTABLE PARTIAL ORDERINGS IN THE ENUMERATION DEGREES AND THE ω-enumeration DEGREES MARIYA I. SOSKOVA AND IVAN N. SOSKOV 1. Introduction One of the most basic measures of the complexity of a

### Testing LTL Formula Translation into Büchi Automata

Testing LTL Formula Translation into Büchi Automata Heikki Tauriainen and Keijo Heljanko Helsinki University of Technology, Laboratory for Theoretical Computer Science, P. O. Box 5400, FIN-02015 HUT, Finland

### Undergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics

Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics An Introductory Single Variable Real Analysis: A Learning Approach through Problem Solving Marcel B. Finan c All Rights

### CHAPTER 5: MODULAR ARITHMETIC

CHAPTER 5: MODULAR ARITHMETIC LECTURE NOTES FOR MATH 378 (CSUSM, SPRING 2009). WAYNE AITKEN 1. Introduction In this chapter we will consider congruence modulo m, and explore the associated arithmetic called

### I. GROUPS: BASIC DEFINITIONS AND EXAMPLES

I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called

### Global Properties of the Turing Degrees and the Turing Jump

Global Properties of the Turing Degrees and the Turing Jump Theodore A. Slaman Department of Mathematics University of California, Berkeley Berkeley, CA 94720-3840, USA slaman@math.berkeley.edu Abstract

### Domain Theory: An Introduction

Domain Theory: An Introduction Robert Cartwright Rebecca Parsons Rice University This monograph is an unauthorized revision of Lectures On A Mathematical Theory of Computation by Dana Scott [3]. Scott

### A note on infinite systems of linear inequalities in Rn

Carnegie Mellon University Research Showcase @ CMU Department of Mathematical Sciences Mellon College of Science 1973 A note on infinite systems of linear inequalities in Rn Charles E. Blair Carnegie Mellon

facultad de informática universidad politécnica de madrid On the Confluence of CHR Analytical Semantics Rémy Haemmerlé Universidad olitécnica de Madrid & IMDEA Software Institute, Spain TR Number CLI2/2014.0

### MATH 289 PROBLEM SET 1: INDUCTION. 1. The induction Principle The following property of the natural numbers is intuitively clear:

MATH 89 PROBLEM SET : INDUCTION The induction Principle The following property of the natural numbers is intuitively clear: Axiom Every nonempty subset of the set of nonnegative integers Z 0 = {0,,, 3,

### Mathematical Induction

Mathematical Induction In logic, we often want to prove that every member of an infinite set has some feature. E.g., we would like to show: N 1 : is a number 1 : has the feature Φ ( x)(n 1 x! 1 x) How

### Markov random fields and Gibbs measures

Chapter Markov random fields and Gibbs measures 1. Conditional independence Suppose X i is a random element of (X i, B i ), for i = 1, 2, 3, with all X i defined on the same probability space (.F, P).

### Chap2: The Real Number System (See Royden pp40)

Chap2: The Real Number System (See Royden pp40) 1 Open and Closed Sets of Real Numbers The simplest sets of real numbers are the intervals. We define the open interval (a, b) to be the set (a, b) = {x

### Research Note. Bi-intuitionistic Boolean Bunched Logic

UCL DEPARTMENT OF COMPUTER SCIENCE Research Note RN/14/06 Bi-intuitionistic Boolean Bunched Logic June, 2014 James Brotherston Dept. of Computer Science University College London Jules Villard Dept. of

### Mathematical Induction. Lecture 10-11

Mathematical Induction Lecture 10-11 Menu Mathematical Induction Strong Induction Recursive Definitions Structural Induction Climbing an Infinite Ladder Suppose we have an infinite ladder: 1. We can reach

### Fundamentele Informatica II

Fundamentele Informatica II Answer to selected exercises 1 John C Martin: Introduction to Languages and the Theory of Computation M.M. Bonsangue (and J. Kleijn) Fall 2011 Let L be a language. It is clear

### Further linear algebra. Chapter I. Integers.

Further linear algebra. Chapter I. Integers. Andrei Yafaev Number theory is the theory of Z = {0, ±1, ±2,...}. 1 Euclid s algorithm, Bézout s identity and the greatest common divisor. We say that a Z divides

### Sets and Cardinality Notes for C. F. Miller

Sets and Cardinality Notes for 620-111 C. F. Miller Semester 1, 2000 Abstract These lecture notes were compiled in the Department of Mathematics and Statistics in the University of Melbourne for the use

### Set theory as a foundation for mathematics

V I I I : Set theory as a foundation for mathematics This material is basically supplementary, and it was not covered in the course. In the first section we discuss the basic axioms of set theory and the

### Partitioning edge-coloured complete graphs into monochromatic cycles and paths

arxiv:1205.5492v1 [math.co] 24 May 2012 Partitioning edge-coloured complete graphs into monochromatic cycles and paths Alexey Pokrovskiy Departement of Mathematics, London School of Economics and Political

### CONTRIBUTIONS TO ZERO SUM PROBLEMS

CONTRIBUTIONS TO ZERO SUM PROBLEMS S. D. ADHIKARI, Y. G. CHEN, J. B. FRIEDLANDER, S. V. KONYAGIN AND F. PAPPALARDI Abstract. A prototype of zero sum theorems, the well known theorem of Erdős, Ginzburg

### (Refer Slide Time: 1:41)

Discrete Mathematical Structures Dr. Kamala Krithivasan Department of Computer Science and Engineering Indian Institute of Technology, Madras Lecture # 10 Sets Today we shall learn about sets. You must

### COFINAL MAXIMAL CHAINS IN THE TURING DEGREES

COFINA MAXIMA CHAINS IN THE TURING DEGREES WEI WANG, IUZHEN WU, AND IANG YU Abstract. Assuming ZF C, we prove that CH holds if and only if there exists a cofinal maximal chain of order type ω 1 in the

### 1 Limiting distribution for a Markov chain

Copyright c 2009 by Karl Sigman Limiting distribution for a Markov chain In these Lecture Notes, we shall study the limiting behavior of Markov chains as time n In particular, under suitable easy-to-check

### Math212a1010 Lebesgue measure.

Math212a1010 Lebesgue measure. October 19, 2010 Today s lecture will be devoted to Lebesgue measure, a creation of Henri Lebesgue, in his thesis, one of the most famous theses in the history of mathematics.

### P (A) = lim P (A) = N(A)/N,

1.1 Probability, Relative Frequency and Classical Definition. Probability is the study of random or non-deterministic experiments. Suppose an experiment can be repeated any number of times, so that we

### arxiv:math/0202219v1 [math.co] 21 Feb 2002

RESTRICTED PERMUTATIONS BY PATTERNS OF TYPE (2, 1) arxiv:math/0202219v1 [math.co] 21 Feb 2002 TOUFIK MANSOUR LaBRI (UMR 5800), Université Bordeaux 1, 351 cours de la Libération, 33405 Talence Cedex, France

### CS 3719 (Theory of Computation and Algorithms) Lecture 4

CS 3719 (Theory of Computation and Algorithms) Lecture 4 Antonina Kolokolova January 18, 2012 1 Undecidable languages 1.1 Church-Turing thesis Let s recap how it all started. In 1990, Hilbert stated a

Section 5.1 Climbing an Infinite Ladder Suppose we have an infinite ladder and the following capabilities: 1. We can reach the first rung of the ladder. 2. If we can reach a particular rung of the ladder,

### Course 421: Algebraic Topology Section 1: Topological Spaces

Course 421: Algebraic Topology Section 1: Topological Spaces David R. Wilkins Copyright c David R. Wilkins 1988 2008 Contents 1 Topological Spaces 1 1.1 Continuity and Topological Spaces...............

### General theory of stochastic processes

CHAPTER 1 General theory of stochastic processes 1.1. Definition of stochastic process First let us recall the definition of a random variable. A random variable is a random number appearing as a result

### Mathematics Course 111: Algebra I Part IV: Vector Spaces

Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are

### Fundamentals of Mathematics Lecture 6: Propositional Logic

Fundamentals of Mathematics Lecture 6: Propositional Logic Guan-Shieng Huang National Chi Nan University, Taiwan Spring, 2008 1 / 39 Connectives Propositional Connectives I 1 Negation: (not A) A A T F

### POWER SETS AND RELATIONS

POWER SETS AND RELATIONS L. MARIZZA A. BAILEY 1. The Power Set Now that we have defined sets as best we can, we can consider a sets of sets. If we were to assume nothing, except the existence of the empty

### Cartesian Products and Relations

Cartesian Products and Relations Definition (Cartesian product) If A and B are sets, the Cartesian product of A and B is the set A B = {(a, b) :(a A) and (b B)}. The following points are worth special

### 4 Basics of Trees. Petr Hliněný, FI MU Brno 1 FI: MA010: Trees and Forests

4 Basics of Trees Trees, actually acyclic connected simple graphs, are among the simplest graph classes. Despite their simplicity, they still have rich structure and many useful application, such as in

### Kolmogorov Complexity and the Incompressibility Method

Kolmogorov Complexity and the Incompressibility Method Holger Arnold 1. Introduction. What makes one object more complex than another? Kolmogorov complexity, or program-size complexity, provides one of

### The Alternating Series Test

The Alternating Series Test So far we have considered mostly series all of whose terms are positive. If the signs of the terms alternate, then testing convergence is a much simpler matter. On the other

### 6. Metric spaces. In this section we review the basic facts about metric spaces. d : X X [0, )

6. Metric spaces In this section we review the basic facts about metric spaces. Definitions. A metric on a non-empty set X is a map with the following properties: d : X X [0, ) (i) If x, y X are points

### A BASIS THEOREM FOR Π 0 1 CLASSES OF POSITIVE MEASURE AND JUMP INVERSION FOR RANDOM REALS ROD DOWNEY AND JOSEPH S. MILLER

A BASIS THEOREM FOR Π 0 1 CLASSES OF POSITIVE MEASURE AND JUMP INVERSION FOR RANDOM REALS ROD DOWNEY AND JOSEPH S. MILLER Abstract. We extend the Shoenfield jump inversion theorem to the members of any

### Omega Automata: Minimization and Learning 1

Omega Automata: Minimization and Learning 1 Oded Maler CNRS - VERIMAG Grenoble, France 2007 1 Joint work with A. Pnueli, late 80s Summary Machine learning in general and of formal languages in particular

### G 0 -dichotomies for -Borel sets

Andrés Eduardo Department of Mathematics Boise State University XI Atelier International de théorie des ensembles CIRM, Luminy, October 4-8, 2010 This is joint work with Richard Ketchersid. I want to thank

### A Propositional Dynamic Logic for CCS Programs

A Propositional Dynamic Logic for CCS Programs Mario R. F. Benevides and L. Menasché Schechter {mario,luis}@cos.ufrj.br Abstract This work presents a Propositional Dynamic Logic in which the programs are

### Inductive topologies in universal algebras

1 Inductive topologies in universal algebras 1 Introduction Harald Worace Institut für Technische Mathemati Technische Universität Wien A-1040 Wien, Austria Treating topological algebra it seems natural