Extracting Feasible Programs

First Page		Document Content
Date: 2006-01-11 06:16:21 Proof theory Functions and mappings Logic in computer science Function Primitive recursive function Curry–Howard correspondence Second-order logic Modal logic Computational complexity theory Mathematics Logic Mathematical logic		Extracting Feasible Programs Add to Reading List Source URL: aaai.org Download Document from Source Website File Size: 82,47 KB Share Document on Facebook

	SECOND-ORDER LOGIC, OR: HOW I LEARNED TO STOP WORRYING AND LOVE THE INCOMPLETENESS THEOREMS ETHAN JERZAK Abstract. First-order logic enjoys a nearly universal status as the language in which mathematics is done—or at l DocID: 1uSZH - View Document
	Symposium on Theoretical Aspects of Computer ScienceBordeaux), ppwww.stacs-conf.org COMPATIBILITY OF SHELAH AND STUPP’S AND MUCHNIK’S ITERATION WITH FRAGMENTS OF MONADIC SECOND ORDER LOGIC DocID: 1uvLn - View Document
	On the Parameterised Intractability of Monadic Second-Order Logic Stephan Kreutzer ⋆ Oxford University Computing Laboratory, Abstract. One of Courcelle’s celebrated results states that if C DocID: 1ukbw - View Document
	Prof. Dr. Mircea Dumitru Lucrări publicate și activitate științifică Prof. dr. Mircea Dumitru Cărţi 1.On Incompleteness in Modal Logic. An Account through Second-Order Logic, UMI, A DocID: 1uhIL - View Document
	Lower Bounds for the Complexity of Monadic Second-Order Logic Stephan Kreutzer University of Oxford Abstract—Courcelle’s famous theorem from 1990 states that DocID: 1u3XX - View Document