LICS 2006 - PDF Preprint Papers

LICS 2006 Symposium on Logic in Computer Science

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed LICS-2006 Paper

click to vote

LICS
2006
IEEE

180views Automated Reasoning» more LICS 2006»

The Boundedness Problem for Monadic Universal First-Order Logic

14 years 5 months ago

Download www.mathematik.tu-darmstadt.de

We consider the monadic boundedness problem for least ﬁxed points over FO formulae as a decision problem: Given a formula ϕ(X, x), positive in X, decide whether there is a unif...

Martin Otto

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	180	The Boundedness Problem for Monadic Universal First-Order Logic	claim
2	159	Boolean Algebras for Lambda Calculus	claim
3	157	On Model-Checking Trees Generated by Higher-Order Recursion Schemes	claim
4	151	A Congruence Rule Format for Name-Passing Process Calculi from Mathematical Structural Operational Semantics	claim
5	136	Independence and Concurrent Separation Logic	claim
6	133	On the Expressiveness of Linearity vs Persistence in the Asychronous Pi-Calculus	claim
7	128	PSPACE Bounds for Rank-1 Modal Logics	claim
8	126	3-Valued Abstraction: More Precision at Less Cost	claim
9	124	Provable Implementations of Security Protocols	claim
10	107	Two-Variable Logic on Words with Data	claim
11	107	Monadic Chain Logic Over Iterations and Applications to Pushdown Systems	claim
12	104	Adapting Logics	claim
13	104	Approximate Satisfiability and Equivalence	claim
14	100	Faster Solutions of Rabin and Streett Games	claim
15	99	Coinductive Proof Principles for Stochastic Processes	claim
16	98	Fixed-Parameter Hierarchies inside PSPACE	claim
17	96	On Tractability and Congruence Distributivity	claim
18	94	Saturated Semantics for Reactive Systems	claim
19	92	Avoiding Determinization	claim
20	91	On Typability for Rank-2 Intersection Types with Polymorphic Recursion	claim
21	90	A Proof of Strong Normalisation using Domain Theory	claim
22	89	Context Semantics, Linear Logic and Computational Complexity	claim
23	89	Stochastic Games with Branching-Time Winning Objectives	claim
24	84	Temporal Logics and Model Checking for Fairly Correct Systems	claim
25	82	Variables as Resource in Hoare Logics	claim
26	81	Control in o-minimal Hybrid Systems	claim
27	75	Managing Digital Rights using Linear Logic	claim
28	69	A Characterisation of First-Order Constraint Satisfaction Problems	claim
29	63	Obsessional Cliques: A Semantic Characterization of Bounded Time Complexity	claim
30	62	Approximation Schemes for First-Order Definable Optimisation Problems	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers