The Consistency of the Continuum Hypothesis Annals of Mathematical Studies, No. 3 Princeton University Press Princeton, N.J., 1940.

Save this PDF as:

Size: px
Start display at page:

Download "The Consistency of the Continuum Hypothesis Annals of Mathematical Studies, No. 3 Princeton University Press Princeton, N.J., 1940."

Transcription

1 TWO COMPUTATIONAL IDEAS Computations with Sets Union, intersection: computable Powerset: not computable Basic operations Absoluteness of Formulas A formula in the language of set theory is absolute if its truth value in a transitive class M, for some assignment v of objects from M to its free variables, depends only on v, but not on M. Both ideas introduced in: K. Gödel The Consistency of the Continuum Hypothesis Annals of Mathematical Studies, No. 3 Princeton University Press Princeton, N.J., 1940.

2 A Syntactic Approximation Every atomic formula is in 0. If ϕ and ψ are in 0, then so are ϕ, ϕ ψ, and ϕ ψ. If x and y are two different variables, and ϕ is in 0, then so is x yϕ.

3 Domain Independence Let σ be a signature without function symbols. Assume that σ includes P = {P 1,..., P n }. A query ϕ(x 1...., x n ) in σ is called P d.i. ( P domainindependent), if whenever: 1. S 1 and S 2 are structures for σ 2. S 1 is a substructure of S 2 3. Each P i P has in S 1 and S 2 the same interpretation then for all a 1 S 2,..., a n S 2 : S 2 = ϕ(a 1,..., a n ) a 1 S 1... a n S 1 S 1 = ϕ(a 1,..., a n )

4 The Class SS( P ) P i (t 1,..., t ni ) SS( P ) in case P i is in P. x = c and c = x are in SS( P ) ϕ ψ SS( P ) if ϕ SS( P ), ψ SS( P ), and the two formulas have the same free variables xϕ SS( P ) if ϕ SS( P ). If ϕ = ϕ 1 ϕ 2... ϕ k, then ϕ SS( P ) if the following conditions are met: 1. For each i, either ϕ i is atomic, or ϕ i is in SS( P ), or ϕ i is a negation of a formula of either type. 2. Every free variable x of ϕ is limited in ϕ. This means that there exists 1 i k such that x is free in ϕ i, and either ϕ i SS( P ), or there exists y which is already limited in ϕ, and ϕ i {x = y, y = x}.

5 Partial Domain Independence Let σ be a signature without function symbols. Assume that σ includes P = {P 1,..., P n }. A query ϕ(x 1...., x n, y 1...., y k ) in σ is called P d.i. with respect to {x 1,..., x n }, if whenever: 1. S 1 and S 2 are structures for σ 2. S 1 is a substructure of S 2 3. Each P i P has in S 1 and S 2 the same interpretation then for all a 1 S 2,..., a n S 2, b 1 S 1,..., b k S 1 : S 2 = ϕ(a 1,..., a n, b 1,..., b k ) a 1 S 1... a n S 1 S 1 = ϕ(a 1,..., a n, b 1,..., b k )

6 A Syntactic Approximation P 0. If ϕ P X and Z X, then ϕ P Z. 1. ϕ F v(ϕ) if ϕ is p(t 1,..., t n ) (where p P ). 2. x x P {x}, t = x P {x}, and x = t P {x} if x F v(t). 3. ϕ P if ϕ P. 4. ϕ ψ P X if ϕ P X and ψ P X. 5. ϕ ψ P X Y if ϕ P X, ψ P Y, and either Y F v(ϕ) = or X F v(ψ) =. 6. yϕ P X {y} if y X and ϕ P X. Notes: {ϕ ϕ P F v(ϕ)} strictly extends SS( P ) If ϕ P {x 1,..., x n }, and ψ, then: x 1... x n (ϕ ψ) P and x 1... x n (ϕ ψ) P.

7 Rich Languages for Set Theories Terms: Every variable is a term. The constant is a term. {x ϕ} is a term in case x is a variable, and ϕ is a formula such that ϕ ST {x}. F v({x ϕ}) = F v(ϕ) {x} Formulas: If t, s are terms than t = s and t s are formulas. If ϕ and ψ are formulas, and x and y are variables, then ϕ, (ϕ ψ), (ϕ ψ), and xϕ are formulas.

8 RST: Rudimentary Set Theory The safety relation: 1. ϕ RST if ϕ is atomic. 2. ϕ RST if ϕ RST. 3. ϕ RST {x} if x F v(t) and ϕ {x x, x = t, t = x, x t} 4. ϕ ψ RST X if ϕ RST X and ψ RST X. 5. ϕ ψ RST X Y if ϕ RST X, ψ RST Y and either Y F v(ϕ) = or X F v(ψ) =. 6. yϕ RST X {y} if y X and ϕ RST X. Axioms: Extensionality: y(y = {x x y}) Comprehension: x(x {x ϕ} ϕ)

9 Examples {t 1,..., t n } = Df {x x = t 1... x = t n } t, s = Df {{t}, {t, s}} {x t ϕ} = Df {x x t ϕ}, provided ϕ Rud {t x s} = Df {y x.x s y = t} s t = Df {x a b.a s b t x = a, b } s t = Df {x x s x t} s t = Df {x x s x t} S(x) = Df x {x} t = Df {x y.y t x y} t = Df {x x t y(y t (x y))} λx s.t = Df { x, t x s} (where x F v(s)) f(x) = Df F where F = {y z v(z f v z y v z = x, y )}

10 Basic Properties of RST Theorem 1. Let T be an extension of RST. 1. If t(x 1,..., x n ) is a term of RST, then t(a 1,..., a n ) has the same interpretation (which should be a set) in all transitive models of T which contain a 1,..., a n. 2. If ϕ(y 1,..., y n, x 1,..., x k ) RST {x 1,..., x k }, then { x 1,..., x k ϕ(a 1,..., a n, x 1,..., x k } has the same extension (which should be a set) in all transitive models of T which contain a 1,..., a n. Theorem 2 1. If F is an n-ary rudimentary function, then there exists a formula ϕ s. t.: (a) F v(ϕ) = {y, x 1,..., x n } (b) ϕ RST {y} (c) F (x 1,..., x n ) = {y ϕ}. 2. If ϕ is a formula such that: (a) F v(ϕ) = {y 1,..., y k, x 1,..., x n } (b) ϕ RST {y 1,..., y k } then there exists a rudimentary function F such that: F (x 1,..., x n ) = { y 1,..., y k ϕ}

11 The Comprehension Axioms of ZF The addition of each of the comprehension axioms of ZF to RST is equivalent to adding to the definition of Rud a certain syntactic condition: Separation: ϕ for every formula ϕ Replacement: yϕ y(ϕ ψ) X if ψ X, and X F v(ϕ) =. Powerset: y(y x ϕ) (X {y}) {x} if ϕ X, y X, and x X. The Other Axioms of ZF Foundations: ( x( y(y x ϕ{y/x}) ϕ)) xϕ Choice: xϕ ϕ{εxϕ/x}

12 Predicative Set Theory P ZF Terms and Axioms: Like in RST. Formulas: If ϕ is a formula, t and s are terms, and x and y are distinct variables then (T C x,y ϕ)(t, s) is a formula F v((t C x,y ϕ)(t, s)) = (F v(ϕ) {x, y}) F v(t) F v(s) The Safety Relation P ZF : (T C x,y ϕ)(x, y) P ZF X provided ϕ P ZF X, and {x, y} X. Logic: T C-Logic An explanation: (T C x,y ϕ)(x, y) is intuitively equivalent to the infinitary disjunction: ϕ(x, y) w 1.ϕ(x, w 1 ) ϕ(w 1, y) w 1 w 2.ϕ(x, w 1 ) ϕ(w 1, w 2 ) ϕ(w 2, y)... where all w 1, w 2,..., are new variables.

13 A General Framework A d.i.-signature is a pair (σ, F ), where σ is an ordinary first-order signature, and F is a function which assigns to every n-ary symbol s from σ (other than equality) a subset of P({1,..., n}). Let S 1 and S 2 be two structures for σ s.t. S 1 S 2. S 2 is called a (σ, F ) extension of S 1 if the following conditions are satisfied: If p σ is a predicate symbol of arity n, I F (p), and a 1,..., a n are elements of S 2 such that a i S 1 in case i I, then S 2 = p(a 1,..., a n ) iff a i S 1 for all i, and S 1 = p(a 1,..., a n ). If f σ is a function symbol of arity n, a 1,..., a n S 1, and b is the value of f(a 1,..., a n ) in S 2, then b S 1, and b is the value of f(a 1,..., a n ) in S 1. Moreover: if I F (f), and a 1,..., a n are elements of S 2 such that a i S 1 in case i I, then S 2 = b = f(a 1,..., a n ) iff a i S 1 for all i, and S 1 = b = f(a 1,..., a n ).

14 A General Framework (II) A formula ϕ of σ is called (σ, F ) d.i. w.r.t. X (ϕ di (σ,f ) X) if whenever S 2 is a (σ, F ) extension of S 1, and ϕ results from ϕ by substituting values from S 1 for the free variables of ϕ that are not in X, then the sets of tuples which satisfy ϕ in S 1 and in S 2 are identical. A formula ϕ of σ is called (σ, F ) d.i. if ϕ di (σ,f ) (σ, F ) absolute if ϕ di (σ,f ). F v(ϕ), and Examples: Let σ be a signature which includes P, and has no function symbols. Assume that the arity of P i is n i, and define F (P i ) = {{1,..., n i }}. Then ϕ is (σ, F ) d.i. w.r.t. X iff it is P d.i. w.r.t. X. Let σ ZF = { } and let F ZF ( ) = {{1}}. In this case the universe V is a (σ ZF, F ZF ) extension of the transitive sets and classes. Therefore a formula is σ ZF - absolute iff it is absolute in the usual sense of set theory.

15 A General Framework (III) The relation (σ,f ) is inductively defined as follows: 0. If ϕ (σ,f ) X and Z X, then ϕ (σ,f ) Z. 1a. If p is an n-ary predicate symbol of σ; x 1,..., x n are n distinct variables, and {i 1,..., i k } is in F (p), then p(x 1,..., x n ) (σ,f ) {x i1,..., x ik }. 1b. If f is an n-ary function symbol of σ; y, x 1,..., x n are n + 1 distinct variables, and {i 1,..., i k } F (f), then y = f(x 1,..., x n ) (σ,f ) {x i1,..., x ik }. 2. ϕ (σ,f ) {x} if ϕ {x x, x = t, t = x}, and x F v(t). 3. ϕ (σ,f ) if ϕ (σ,f ). 4. ϕ ψ (σ,f ) X if ϕ (σ,f ) X and ψ (σ,f ) X. 5. ϕ ψ (σ,f ) X Y if ϕ (σ,f ) X, ψ (σ,f ) Y, and Y F v(ϕ) = (or X F v(ψ) = ). 6. yϕ (σ,f ) X {y} if y X and ϕ (σ,f ) X. Conjecture. A formula is upward (σ, F )-absolute iff it is logically equivalent to a formula of the y 1,..., y n ψ, where ψ (σ,f )

16 Computability in N The d.i. signature (σ N, F N ) is defined as follows: σ N is the first-order signature which includes the constants 0 and 1, the binary predicate <, and the ternary relations P + and P. F N (<) = {{1}}, F N (P + ) = F N (P ) = { }. Obviously, N is a (σ N, F N )-extension of a structure for σ N iff its domain is an initial segment of N. Theorem. The following conditions are equivalent for a relation R on N: 1. R is semi-decidable. 2. R is definable by a formula of the form y 1,..., y n ψ, where ψ (σn,f N ). 3. R is definable by a formula of the form y 1,..., y n ψ, where the formula ψ is (σ N, F N )-absolute.

17 A Characterization of (σn,f N ) Let N = (σn,f N ). Then N can be defined as follows: 1. ϕ N if ϕ is atomic. 2. ϕ N {x} if ϕ {x x, x = t, t = x, x < t}, and x F v(t). 3. ϕ N if ϕ N. 4. ϕ ψ N X if ϕ N X and ψ N X. 5. ϕ ψ N X Y if ϕ N X, ψ N Y, and either Y F v(ϕ) = or X F v(ψ) =. 6. yϕ N X {y} if y X and ϕ N X. Note. It is easy to see that the set of formulas ϕ such that ϕ N is a straightforward extension of Smullyan s set of bounded formulas.

18 Transitive Closure Again Let V 0 be the smallest set including 0 and closed under the operation of pairing. Then a subset S of V 0 is recursively enumerable iff there exists a formula ϕ(x) of PT C + such that S = {x V 0 ϕ(x)}, where the language PT C + is defined as follows: Terms of PT C + 1. The constant 0 is a term. 2. Every (individual) variable is a term. 3. If t and s are terms then so is (t, s). Formulas of PT C + 1. If t and s are terms then t = s is a formula. 2. If ϕ and ψ are formulas then so are ϕ ψ and ϕ ψ. 3. If ϕ is a formula, x, y are two different variables, and t, s are terms, then (T C x,y ϕ)(t, s) is a formula.

A New Approach to Predicative Set Theory

A New Approach to Predicative Set Theory Arnon Avron School of Computer Science, Tel Aviv University, Israel Abstract We suggest a new basic framework for the Weyl-Feferman predicativist program by constructing

First-Order Logics and Truth Degrees

First-Order Logics and Truth Degrees George Metcalfe Mathematics Institute University of Bern LATD 2014, Vienna Summer of Logic, 15-19 July 2014 George Metcalfe (University of Bern) First-Order Logics

Fixed-Point Logics and Computation

1 Fixed-Point Logics and Computation Symposium on the Unusual Effectiveness of Logic in Computer Science University of Cambridge 2 Mathematical Logic Mathematical logic seeks to formalise the process of

Computational Logic and Cognitive Science: An Overview

Computational Logic and Cognitive Science: An Overview Session 1: Logical Foundations Technical University of Dresden 25th of August, 2008 University of Osnabrück Who we are Helmar Gust Interests: Analogical

CODING TRUE ARITHMETIC IN THE MEDVEDEV AND MUCHNIK DEGREES

CODING TRUE ARITHMETIC IN THE MEDVEDEV AND MUCHNIK DEGREES PAUL SHAFER Abstract. We prove that the first-order theory of the Medvedev degrees, the first-order theory of the Muchnik degrees, and the third-order

Expressive powver of logical languages

July 18, 2012 Expressive power distinguishability The expressive power of any language can be measured through its power of distinction or equivalently, by the situations it considers indistinguishable.

DEFINABLE TYPES IN PRESBURGER ARITHMETIC

DEFINABLE TYPES IN PRESBURGER ARITHMETIC GABRIEL CONANT Abstract. We consider the first order theory of (Z, +,

Scalable Automated Symbolic Analysis of Administrative Role-Based Access Control Policies by SMT solving

Scalable Automated Symbolic Analysis of Administrative Role-Based Access Control Policies by SMT solving Alessandro Armando 1,2 and Silvio Ranise 2, 1 DIST, Università degli Studi di Genova, Italia 2 Security

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

The Recovery of a Schema Mapping: Bringing Exchanged Data Back

The Recovery of a Schema Mapping: Bringing Exchanged Data Back MARCELO ARENAS and JORGE PÉREZ Pontificia Universidad Católica de Chile and CRISTIAN RIVEROS R&M Tech Ingeniería y Servicios Limitada A schema

MODELS OF SET THEORY

MODELS OF SET THEORY STEFAN GESCHKE Contents 1. First order logic and the axioms of set theory 2 1.1. Syntax 2 1.2. Semantics 2 1.3. Completeness, compactness and consistency 3 1.4. Foundations of mathematics

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

First-Order Theories

First-Order Theories Ruzica Piskac Max Planck Institute for Software Systems, Germany piskac@mpi-sws.org Seminar on Decision Procedures 2012 Ruzica Piskac First-Order Theories 1 / 39 Acknowledgments Theories

AN INTRODUCTION TO SET THEORY. Professor William A. R. Weiss

AN INTRODUCTION TO SET THEORY Professor William A. R. Weiss October 2, 2008 2 Contents 0 Introduction 7 1 LOST 11 2 FOUND 19 3 The Axioms of Set Theory 23 4 The Natural Numbers 31 5 The Ordinal Numbers

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

(LMCS, p. 317) V.1. First Order Logic. This is the most powerful, most expressive logic that we will examine.

(LMCS, p. 317) V.1 First Order Logic This is the most powerful, most expressive logic that we will examine. Our version of first-order logic will use the following symbols: variables connectives (,,,,

INTRODUCTORY SET THEORY

M.Sc. program in mathematics INTRODUCTORY SET THEORY Katalin Károlyi Department of Applied Analysis, Eötvös Loránd University H-1088 Budapest, Múzeum krt. 6-8. CONTENTS 1. SETS Set, equal sets, subset,

2. The Language of First-order Logic

2. The Language of First-order Logic KR & R Brachman & Levesque 2005 17 Declarative language Before building system before there can be learning, reasoning, planning, explanation... need to be able to

ON FUNCTIONAL SYMBOL-FREE LOGIC PROGRAMS

PROCEEDINGS OF THE YEREVAN STATE UNIVERSITY Physical and Mathematical Sciences 2012 1 p. 43 48 ON FUNCTIONAL SYMBOL-FREE LOGIC PROGRAMS I nf or m at i cs L. A. HAYKAZYAN * Chair of Programming and Information

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 ).

A Beginner s Guide to Modern Set Theory

A Beginner s Guide to Modern Set Theory Martin Dowd Product of Hyperon Software PO Box 4161 Costa Mesa, CA 92628 www.hyperonsoft.com Copyright c 2010 by Martin Dowd 1. Introduction..... 1 2. Formal logic......

WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT?

WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT? introduction Many students seem to have trouble with the notion of a mathematical proof. People that come to a course like Math 216, who certainly

First-Order Stable Model Semantics and First-Order Loop Formulas

Journal of Artificial Intelligence Research 42 (2011) 125-180 Submitted 03/11; published 10/11 First-Order Stable Model Semantics and First-Order Loop Formulas Joohyung Lee Yunsong Meng School of Computing,

1 Elementary Set Theory

1 Elementary Set Theory Notation: {} enclose a set. {1, 2, 3} = {3, 2, 2, 1, 3} because a set is not defined by order or multiplicity. {0, 2, 4,...} = {x x is an even natural number} because two ways of

Logic in general. Inference rules and theorem proving

Logical Agents Knowledge-based agents Logic in general Propositional logic Inference rules and theorem proving First order logic Knowledge-based agents Inference engine Knowledge base Domain-independent

There is no degree invariant half-jump

There is no degree invariant half-jump Rod Downey Mathematics Department Victoria University of Wellington P O Box 600 Wellington New Zealand Richard A. Shore Mathematics Department Cornell University

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

Mathematics for Computer Science/Software Engineering. Notes for the course MSM1F3 Dr. R. A. Wilson

Mathematics for Computer Science/Software Engineering Notes for the course MSM1F3 Dr. R. A. Wilson October 1996 Chapter 1 Logic Lecture no. 1. We introduce the concept of a proposition, which is a statement

An introduction to Good old fashioned model theory

[Held in 120../A000-wholething.. Last changed July 26, 2004] An introduction to Good old fashioned model theory [Held in 120../Preamble.. Last changed July 26, 2004] The course will be taught Each Tuesday

The Language of Mathematics

CHPTER 2 The Language of Mathematics 2.1. Set Theory 2.1.1. Sets. set is a collection of objects, called elements of the set. set can be represented by listing its elements between braces: = {1, 2, 3,

Foundations of mathematics

Foundations of mathematics 1. First foundations of mathematics 1.1. Introduction to the foundations of mathematics Mathematics, theories and foundations Sylvain Poirier http://settheory.net/ Mathematics

Foundations of mathematics. 2. Set theory (continued)

2.1. Tuples, amilies Foundations o mathematics 2. Set theory (continued) Sylvain Poirier settheory.net A tuple (or n-tuple, or any integer n) is an interpretation o a list o n variables. It is thus a meta-unction

x < y iff x < y, or x and y are incomparable and x χ(x,y) < y χ(x,y).

12. Large cardinals The study, or use, of large cardinals is one of the most active areas of research in set theory currently. There are many provably different kinds of large cardinals whose descriptions

Introduction to Modern Set Theory

Introduction to Modern Set Theory Judith Roitman December 6, 2011 1 for my father, who loved mathematics 1 Revised Edition Copyright 2011 by Judith Roitman, This book is licensed for use under a Creative

Schema Mappings and Data Exchange

Schema Mappings and Data Exchange Phokion G. Kolaitis University of California, Santa Cruz & IBM Research-Almaden EASSLC 2012 Southwest University August 2012 1 Logic and Databases Extensive interaction

Discrete Mathematics

Discrete Mathematics Chih-Wei Yi Dept. of Computer Science National Chiao Tung University March 16, 2009 2.1 Sets 2.1 Sets 2.1 Sets Basic Notations for Sets For sets, we ll use variables S, T, U,. We can

Relational Methodology for Data Mining and Knowledge Discovery

Relational Methodology for Data Mining and Knowledge Discovery Vityaev E.E.* 1, Kovalerchuk B.Y. 2 1 Sobolev Institute of Mathematics SB RAS, Novosibirsk State University, Novosibirsk, 630090, Russia.

Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm.

Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm. We begin by defining the ring of polynomials with coefficients in a ring R. After some preliminary results, we specialize

o-minimality and Uniformity in n 1 Graphs

o-minimality and Uniformity in n 1 Graphs Reid Dale July 10, 2013 Contents 1 Introduction 2 2 Languages and Structures 2 3 Definability and Tame Geometry 4 4 Applications to n 1 Graphs 6 5 Further Directions

Relational Calculus. Module 3, Lecture 2. Database Management Systems, R. Ramakrishnan 1

Relational Calculus Module 3, Lecture 2 Database Management Systems, R. Ramakrishnan 1 Relational Calculus Comes in two flavours: Tuple relational calculus (TRC) and Domain relational calculus (DRC). Calculus

Predicate logic. Logic in computer science. Logic in Computer Science (lecture) PART II. first order logic

PART II. Predicate logic first order logic Logic in computer science Seminar: INGK401-K5; INHK401; INJK401-K4 University of Debrecen, Faculty of Informatics kadek.tamas@inf.unideb.hu 1 / 19 Alphabets Logical

Summary Last Lecture. Automated Reasoning. Outline of the Lecture. Definition sequent calculus. Theorem (Normalisation and Strong Normalisation)

Summary Summary Last Lecture sequent calculus Automated Reasoning Georg Moser Institute of Computer Science @ UIBK Winter 013 (Normalisation and Strong Normalisation) let Π be a proof in minimal logic

Semantics of UML class diagrams

1 Otto-von-Guericke Universität Magdeburg, Germany April 26, 2016 Sets Definition (Set) A set is a collection of objects. The basic relation is membership: x A (x is a member of A) The following operations

Examination 110 Probability and Statistics Examination

Examination 0 Probability and Statistics Examination Sample Examination Questions The Probability and Statistics Examination consists of 5 multiple-choice test questions. The test is a three-hour examination

Copyright 2012 MECS I.J.Information Technology and Computer Science, 2012, 1, 50-63

I.J. Information Technology and Computer Science, 2012, 1, 50-63 Published Online February 2012 in MECS (http://www.mecs-press.org/) DOI: 10.5815/ijitcs.2012.01.07 Using Logic Programming to Represent

Semantics for Non-Monotone Queries in Data Exchange and Data Integration

Semantics for Non-Monotone Queries in Data Exchange and Data Integration André Hernich Humboldt University Berlin Germany hernich@informatik.hu-berlin.de Abstract A fundamental question in data exchange

Math 223 Abstract Algebra Lecture Notes

Math 223 Abstract Algebra Lecture Notes Steven Tschantz Spring 2001 (Apr. 23 version) Preamble These notes are intended to supplement the lectures and make up for the lack of a textbook for the course

Introduction to Predicate Logic. Ling324 Reading: Meaning and Grammar, pg

Introduction to Predicate Logic Ling324 Reading: Meaning and Grammar, pg. 113-141 Usefulness of Predicate Logic for Natural Language Semantics While in propositional logic, we can only talk about sentences

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

Lights and Darks of the Star-Free Star

Lights and Darks of the Star-Free Star Edward Ochmański & Krystyna Stawikowska Nicolaus Copernicus University, Toruń, Poland Introduction: star may destroy recognizability In (finitely generated) trace

! " # The Logic of Descriptions. Logics for Data and Knowledge Representation. Terminology. Overview. Three Basic Features. Some History on DLs

,!0((,.+#\$),%\$(-&.& *,2(-\$)%&2.'3&%!&, Logics for Data and Knowledge Representation Alessandro Agostini agostini@dit.unitn.it University of Trento Fausto Giunchiglia fausto@dit.unitn.it The Logic of Descriptions!\$%&'()*\$#)

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

Second order logic, set theory and foundations of mathematics

Second order logic, set theory and foundations of mathematics Jouko Väänänen Department of Mathematics and Statistics University of Helsinki and Institute for Logic, Language and Computation University

A Note on Context Logic

A Note on Context Logic Philippa Gardner Imperial College London This note describes joint work with Cristiano Calcagno and Uri Zarfaty. It introduces the general theory of Context Logic, and has been

The Foundations of Mathematics

The Foundations of Mathematics c 2005,2006,2007 Kenneth Kunen Kenneth Kunen October 29, 2007 Contents 0 Introduction 3 0.1 Prerequisites.................................. 3 0.2 Logical Notation...............................

Software Modeling and Verification

Software Modeling and Verification Alessandro Aldini DiSBeF - Sezione STI University of Urbino Carlo Bo Italy 3-4 February 2015 Algorithmic verification Correctness problem Is the software/hardware system

Chapter 13: Basic ring theory

Chapter 3: Basic ring theory Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 42, Spring 24 M. Macauley (Clemson) Chapter 3: Basic ring

Lecture 16 : Relations and Functions DRAFT

CS/Math 240: Introduction to Discrete Mathematics 3/29/2011 Lecture 16 : Relations and Functions Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT In Lecture 3, we described a correspondence

MA651 Topology. Lecture 6. Separation Axioms.

MA651 Topology. Lecture 6. Separation Axioms. This text is based on the following books: Fundamental concepts of topology by Peter O Neil Elements of Mathematics: General Topology by Nicolas Bourbaki Counterexamples

The Galois Connection between Syntax and Semantics

The Galois Connection between Syntax and Semantics Peter Smith University of Cambridge Note: The material in Chs. 2 and 3 now appears, in revised form, as (stand-alone) chapters in my Notes on Category

One More Decidable Class of Finitely Ground Programs

One More Decidable Class of Finitely Ground Programs Yuliya Lierler and Vladimir Lifschitz Department of Computer Sciences, University of Texas at Austin {yuliya,vl}@cs.utexas.edu Abstract. When a logic

Problems on Discrete Mathematics 1

Problems on Discrete Mathematics 1 Chung-Chih Li 2 Kishan Mehrotra 3 Syracuse University, New York L A TEX at January 11, 2007 (Part I) 1 No part of this book can be reproduced without permission from

Probabilità e Nondeterminismo nella teoria dei domini

Probabilità e Nondeterminismo nella teoria dei domini Daniele Varacca ENS, Paris BRICS, Aarhus Parma, 15 giugno 2004 Probabilità e Nondeterminismo nella teoria dei domini p.1 Road Map Motivation Domain

EQUATIONAL LOGIC AND ABSTRACT ALGEBRA * ABSTRACT

EQUATIONAL LOGIC AND ABSTRACT ALGEBRA * Taje I. Ramsamujh Florida International University Mathematics Department ABSTRACT Equational logic is a formalization of the deductive methods encountered in studying

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

Equivalence in Answer Set Programming Mauricio Osorio, Juan Antonio Navarro, José Arrazola Universidad de las Américas, CENTIA Sta. Catarina Mártir, Cholula, Puebla 72820 México {josorio, ma108907, arrazola}@mail.udlap.mx

On Recognizable Timed Languages FOSSACS 2004

On Recognizable Timed Languages Oded Maler VERIMAG Grenoble France Amir Pnueli NYU and Weizmann New York and Rehovot USA FOSSACS 2004 Nutrition Facts Classical (Untimed) Recognizability Timed Languages

Invertible elements in associates and semigroups. 1

Quasigroups and Related Systems 5 (1998), 53 68 Invertible elements in associates and semigroups. 1 Fedir Sokhatsky Abstract Some invertibility criteria of an element in associates, in particular in n-ary

Language. Johann Eder. Universitat Klagenfurt. Institut fur Informatik. Universiatsstr. 65. A-9020 Klagenfurt / AUSTRIA

PLOP: A Polymorphic Logic Database Programming Language Johann Eder Universitat Klagenfurt Institut fur Informatik Universiatsstr. 65 A-9020 Klagenfurt / AUSTRIA February 12, 1993 Extended Abstract The

Discrete Mathematics Set Operations

Discrete Mathematics 1-3. Set Operations Introduction to Set Theory A setis a new type of structure, representing an unordered collection (group, plurality) of zero or more distinct (different) objects.

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

Computational Methods for Database Repair by Signed Formulae

Computational Methods for Database Repair by Signed Formulae Ofer Arieli (oarieli@mta.ac.il) Department of Computer Science, The Academic College of Tel-Aviv, 4 Antokolski street, Tel-Aviv 61161, Israel.

Biinterpretability up to double jump in the degrees

Biinterpretability up to double jump in the degrees below 0 0 Richard A. Shore Department of Mathematics Cornell University Ithaca NY 14853 July 29, 2013 Abstract We prove that, for every z 0 0 with z

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

Certain Answers as Objects and Knowledge

Certain Answers as Objects and Knowledge Leonid Libkin School of Informatics, University of Edinburgh Abstract The standard way of answering queries over incomplete databases is to compute certain answers,

Automated Theorem Proving - summary of lecture 1

Automated Theorem Proving - summary of lecture 1 1 Introduction Automated Theorem Proving (ATP) deals with the development of computer programs that show that some statement is a logical consequence of

THE PRIME NUMBER THEOREM

THE PRIME NUMBER THEOREM NIKOLAOS PATTAKOS. introduction In number theory, this Theorem describes the asymptotic distribution of the prime numbers. The Prime Number Theorem gives a general description

The Foundations: Logic and Proofs. Chapter 1, Part III: Proofs

The Foundations: Logic and Proofs Chapter 1, Part III: Proofs Rules of Inference Section 1.6 Section Summary Valid Arguments Inference Rules for Propositional Logic Using Rules of Inference to Build Arguments

Rigorous Software Development CSCI-GA 3033-009

Rigorous Software Development CSCI-GA 3033-009 Instructor: Thomas Wies Spring 2013 Lecture 11 Semantics of Programming Languages Denotational Semantics Meaning of a program is defined as the mathematical

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

CmSc 175 Discrete Mathematics Lesson 10: SETS A B, A B

CmSc 175 Discrete Mathematics Lesson 10: SETS Sets: finite, infinite, : empty set, U : universal set Describing a set: Enumeration = {a, b, c} Predicates = {x P(x)} Recursive definition, e.g. sequences

Magic Sets and their Application to Data Integration

Magic Sets and their Application to Data Integration Wolfgang Faber, Gianluigi Greco, Nicola Leone Department of Mathematics University of Calabria, Italy {faber,greco,leone}@mat.unical.it Roadmap Motivation:

3. Mathematical Induction

3. MATHEMATICAL INDUCTION 83 3. Mathematical Induction 3.1. First Principle of Mathematical Induction. Let P (n) be a predicate with domain of discourse (over) the natural numbers N = {0, 1,,...}. If (1)

Composing Schema Mappings: Second-Order Dependencies to the Rescue

Composing Schema Mappings: Second-Order Dependencies to the Rescue Ronald Fagin IBM Almaden Research Center fagin@almaden.ibm.com Phokion G. Kolaitis UC Santa Cruz kolaitis@cs.ucsc.edu Wang-Chiew Tan UC

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

Equality and dependent type theory. Oberwolfach, March 2 (with some later corrections)

Oberwolfach, March 2 (with some later corrections) The Axiom of Univalence, a type-theoretic view point In type theory, we reduce proof-checking to type-checking Hence we want type-checking to be decidable

1 = (a 0 + b 0 α) 2 + + (a m 1 + b m 1 α) 2. for certain elements a 0,..., a m 1, b 0,..., b m 1 of F. Multiplying out, we obtain

Notes on real-closed fields These notes develop the algebraic background needed to understand the model theory of real-closed fields. To understand these notes, a standard graduate course in algebra is

Logic, Algebra and Truth Degrees 2008. Siena. A characterization of rst order rational Pavelka's logic

Logic, Algebra and Truth Degrees 2008 September 8-11, 2008 Siena A characterization of rst order rational Pavelka's logic Xavier Caicedo Universidad de los Andes, Bogota Under appropriate formulations,

Lecture 8: Resolution theorem-proving

Comp24412 Symbolic AI Lecture 8: Resolution theorem-proving Ian Pratt-Hartmann Room KB2.38: email: ipratt@cs.man.ac.uk 2014 15 In the previous Lecture, we met SATCHMO, a first-order theorem-prover implemented

Data Integration: A Theoretical Perspective

Data Integration: A Theoretical Perspective Maurizio Lenzerini Dipartimento di Informatica e Sistemistica Università di Roma La Sapienza Via Salaria 113, I 00198 Roma, Italy lenzerini@dis.uniroma1.it ABSTRACT

Transcription to LaTex/pdf of Alan Turing PhD dissertation (1938)

Transcription to LaTex/pdf of Alan Turing PhD dissertation (1938) presented to the faculty of Princeton University in candidacy for the degree of Doctor of Philosophy Transcribed by Armando B. Matos Artificial

Basics of Probability

Basics of Probability 1 Sample spaces, events and probabilities Begin with a set Ω the sample space e.g., 6 possible rolls of a die. ω Ω is a sample point/possible world/atomic event A probability space

Automata and Formal Languages

Automata and Formal Languages Winter 2009-2010 Yacov Hel-Or 1 What this course is all about This course is about mathematical models of computation We ll study different machine models (finite automata,

Truth as Modality. Amsterdam Workshop on Truth 13 March 2013 truth be told again. Theodora Achourioti. ILLC University of Amsterdam

Truth as Modality Amsterdam Workshop on Truth 13 March 2013 truth be told again Theodora Achourioti ILLC University of Amsterdam Philosophical preliminaries i The philosophical idea: There is more to truth

Predicate Logic. Example: All men are mortal. Socrates is a man. Socrates is mortal.

Predicate Logic Example: All men are mortal. Socrates is a man. Socrates is mortal. Note: We need logic laws that work for statements involving quantities like some and all. In English, the predicate is

Foundations of Logic and Mathematics

Yves Nievergelt Foundations of Logic and Mathematics Applications to Computer Science and Cryptography Birkhäuser Boston Basel Berlin Contents Preface Outline xiii xv A Theory 1 0 Boolean Algebraic Logic

Radboud Universiteit Nijmegen Faculteit der Natuurwetenschappen, Wiskunde en Informatica Uniqueness of the Hyperreal Field Noud Aldenhoven (0620874) Supervisor: dr. W.H.M. Veldman Second reader: prof.

Summary of Last Lecture. Automated Reasoning. Outline of the Lecture. Definition. Example. Lemma non-redundant superposition inferences are liftable

Summary Automated Reasoning Georg Moser Institute of Computer Science @ UIBK Summary of Last Lecture C A D B (C D)σ C s = t D A[s ] (C D A[t])σ ORe OPm(L) C s = t D u[s ] v SpL (C D u[t] v)σ C s t Cσ ERR