LICS 2007 - PDF Preprint Papers

LICS 2007 Symposium on Logic in Computer Science

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed LICS-2007 Paper

click to vote

LICS
2007
IEEE

162views Automated Reasoning» more LICS 2007»

Principles of Superdeduction

14 years 5 months ago

Download www.loria.fr

In predicate logic, the proof that a theorem P holds in a theory Th is typically conducted in natural deduction or in the sequent calculus using all the information contained in t...

Paul Brauner, Clément Houtmann, Claude Kirc...

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	162	Principles of Superdeduction	claim
2	155	A Complete Axiomatization of Knowledge and Cryptography	claim
3	152	Alternation-free modal mu-calculus for data trees	claim
4	135	First-Order and Temporal Logics for Nested Words	claim
5	131	Local Action and Abstract Separation Logic	claim
6	123	Relational Parametricity for Computational Effects	claim
7	121	Limits of Multi-Discounted Markov Decision Processes	claim
8	118	Symmetric Datalog and Constraint Satisfaction Problems in Logspace	claim
9	117	Characterising Testing Preorders for Finite Probabilistic Processes	claim
10	117	Pi-Calculus in Logical Form	claim
11	113	A Contraction Method to Decide MSO Theories of Deterministic Trees	claim
12	111	The Cost of Punctuality	claim
13	109	Strong Normalization as Safe Interaction	claim
14	108	Higher-Order Matching, Games and Automata	claim
15	103	Categorical Combinatorics for Innocent Strategies	claim
16	103	Modified Realizability Interpretation of Classical Linear Logic	claim
17	102	Full abstraction for nominal general references	claim
18	101	Game Relations and Metrics	claim
19	101	On Noetherian Spaces	claim
20	101	A Robust Class of Context-Sensitive Languages	claim
21	99	Complete Sequent Calculi for Induction and Infinite Descent	claim
22	98	Resource modalities in game semantics	claim
23	98	Static Name Control for FreshML	claim
24	97	Reflections on Finite Model Theory	claim
25	93	A Dependent Set Theory	claim
26	91	Environmental Bisimulations for Higher-Order Languages	claim
27	88	Light Logics and Optimal Reduction: Completeness and Complexity	claim
28	85	Bialgebraic Operational Semantics and Modal Logic	claim
29	84	A computable approach to measure and integration theory	claim
30	82	Locally Excluding a Minor	claim
31	81	Separating DAG-Like and Tree-Like Proof Systems	claim
32	80	Two-way unary temporal logic over trees	claim
33	76	Tractability and learnability arising from algebras with few subpowers	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers