LICS 1999 - PDF Preprint Papers

LICS 1999 Symposium on Logic in Computer Science

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed LICS-1999 Paper

click to vote

LICS
1999
IEEE

159views Automated Reasoning» more LICS 1999»

First-Order Logic vs. Fixed-Point Logic in Finite Set Theory

14 years 4 months ago

Download www.lsi.upc.es

The ordered conjecture states that least fixed-point logic LFP is strictly more expressive than first-order logic FO on every infinite class of ordered finite structures. It has b...

Albert Atserias, Phokion G. Kolaitis

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	159	First-Order Logic vs. Fixed-Point Logic in Finite Set Theory	claim
2	135	Towards a Theory of Bisimulation for Local Names	claim
3	134	Counting and Addition Cannot Express Deterministic Transitive Closure	claim
4	132	Plausibility Measures and Default Reasoning: An Overview	claim
5	130	Abstract Syntax and Variable Binding	claim
6	126	Concurrent Games and Full Completeness	claim
7	122	Full Completeness of the Multiplicative Linear Logic of Chu Spaces	claim
8	122	Proving Security Protocols Correct	claim
9	116	Extensional Equality in Intensional Type Theory	claim
10	116	Guarded Fixed Point Logic	claim
11	114	The Higher-Order Recursive Path Ordering	claim
12	106	On Hoare Logic and Kleene Algebra with Tests	claim
13	103	Type Inference for Recursive Definitions	claim
14	101	Subtyping Recursive Types in Kernel Fun	claim
15	98	Proof Techniques for Cryptographic Processes	claim
16	95	Region Analysis and the Polymorphic Lambda Calculus	claim
17	89	Logics with Aggregate Operators	claim
18	88	Entailment of Atomic Set Constraints is PSPACE-Complete	claim
19	84	A Superposition Decision Procedure for the Guarded Fragment with Equality	claim
20	84	Correctness of Multiplicative Proof Nets Is Linear	claim
21	82	A New Approach to Abstract Syntax Involving Binders	claim
22	82	Non-Deterministic Games and Program Analysis: An Application to Security	claim
23	79	Some Decision Problems of Enormous Complexity	claim
24	78	Weak Bisimulation and Open Maps	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers