Lecture 4: Is that Really Revising Logic? König’s paradox (and Berry’s variant). Let L be any language whose formulas are finite strings of finitely many basic symbols. Then (K1)

First Page		Document Content
Date: 2008-05-15 07:08:03 Set theory Berry paradox Constructible universe Ordinal numbers Computability theory Definable real number Proof theory Ordinal definable set Mathematical logic Mathematics Philosophy of mathematics		Lecture 4: Is that Really Revising Logic? König’s paradox (and Berry’s variant). Let L be any language whose formulas are finite strings of finitely many basic symbols. Then (K1) Add to Reading List Source URL: www.philosophy.ox.ac.uk Download Document from Source Website File Size: 116,51 KB Share Document on Facebook

	PDF Document DocID: 1pZ37 - View Document
	Tarski Lectures: Compact spaces, definability, and measures in model theory Anand Pillay University of Leeds Berkeley, April 6th, 8th, and 10th, 2009 DocID: 18tei - View Document
	Lecture 4: Is that Really Revising Logic? König’s paradox (and Berry’s variant). Let L be any language whose formulas are finite strings of finitely many basic symbols. Then (K1) DocID: 14xuC - View Document
	NOTES ON O-MINIMALITY SERGEI STARCHENKO 1 C ONTENTS DocID: NCSC - View Document
	Decidability of Definability Manuel Bodirsky ´ CNRS / LIX, Ecole Polytechnique Joint work with Michael Pinsker and Todor Tsankov DocID: NdeO - View Document