Logical Refinements of Church's Problem

15 years 6 months ago

Download www.cs.tau.ac.il

Abstract. Church's Problem (1962) asks for the construction of a procedure which, given a logical specification on sequence pairs, realizes for any input sequence X an output sequence Y such that (X, Y ) satisfies . B

Alexander Rabinovich, Wolfgang Thomas

Real-time Traffic

Automated Reasoning | CSL 2007 | General Logical Setting | Logical Specification | Specification |

claim paper

» Game semantics for firstorder logic

» Decidable Extensions of Churchs Problem

» Church Synthesis Problem with Parameters

» Churchs Problem and a Tour through Automata Theory

» The senses of functions in the Logic of Sense and Denotation

» Selection and Uniformization Problems in the Monadic Theory of Ordinals A Survey

» THF0 The Core of the TPTP Language for HigherOrder Logic

» A typed lambda calculus with intersection types

Post Info
More Details (n/a)

Added	14 Aug 2010
Updated	14 Aug 2010
Type	Conference
Year	2007
Where	CSL
Authors	Alexander Rabinovich, Wolfgang Thomas

Comments (0)

Sciweavers

Logical Refinements of Church's Problem

Automated Reasoning | CSL 2007 | General Logical Setting | Logical Specification | Specification |

Explore & Download

Productivity Tools

Sciweavers