CSL 2009 - PDF Preprint Papers

CSL 2009 Workshop on Computer Science Logic

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed CSL-2009 Paper

click to vote

CSL
2009
Springer

181views Automated Reasoning» more CSL 2009»

Decidable Extensions of Church's Problem

12 years 10 months ago

Download www.math.tau.ac.il

Abstract. For a two-variable formula B(X,Y) of Monadic Logic of Order (MLO) the Church Synthesis Problem concerns the existence and construction of a ﬁnite-state operator Y=F(X) ...

Alexander Rabinovich

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	181	Decidable Extensions of Church's Problem	claim
2	179	Focalisation and Classical Realisability	claim
3	179	Tree-Width for First Order Formulae	claim
4	166	Nested Hoare Triples and Frame Rules for Higher-Order Store	claim
5	164	Model Checking FO(R) over One-Counter Processes and beyond	claim
6	154	Expanding the Realm of Systematic Proof Theory	claim
7	153	Algorithmic Analysis of Array-Accessing Programs	claim
8	146	From Coinductive Proofs to Exact Real Arithmetic	claim
9	144	Fixed-Point Definability and Polynomial Time	claim
10	139	Decision Problems for Nash Equilibria in Stochastic Games	claim
11	138	The Ackermann Award 2009	claim
12	134	Craig Interpolation for Linear Temporal Languages	claim
13	129	Forcing and Type Theory	claim
14	129	Nominal Domain Theory for Concurrency	claim
15	121	Automatic Structures of Bounded Degree Revisited	claim
16	119	On the Parameterised Intractability of Monadic Second-Order Logic	claim
17	114	Intersection, Universally Quantified, and Reference Types	claim
18	113	Confluence of Pure Differential Nets with Promotion	claim
19	111	Kleene's Amazing Second Recursion Theorem	claim
20	109	Functional Interpretations of Intuitionistic Linear Logic	claim
21	107	Cardinality Quantifiers in MLO over Trees	claim
22	104	Decidable Relationships between Consistency Notions for Constraint Satisfaction Problems	claim
23	104	Efficient Type-Checking for Amortised Heap-Space Analysis	claim
24	103	A Complete Characterization of Observational Equivalence in Polymorphic lambda-Calculus with General References	claim
25	98	Enriching an Effect Calculus with Linear Types	claim
26	89	Linear Game Automata: Decidable Hierarchy Problems for Stripped-Down Alternating Tree Automata	claim
27	81	On the Relation between Sized-Types Based Termination and Semantic Labelling	claim
28	81	Upper Bounds on Stream I/O Using Semantic Interpretations	claim
29	78	Non-Commutative First-Order Sequent Calculus	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers