LICS 2008 - PDF Preprint Papers

LICS 2008 Symposium on Logic in Computer Science

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed LICS-2008 Paper

click to vote

LICS
2008
IEEE

200views Automated Reasoning» more LICS 2008»

From Axioms to Analytic Rules in Nonclassical Logics

13 years 10 months ago

Download www.logic.at

We introduce a systematic procedure to transform large classes of (Hilbert) axioms into equivalent inference rules in sequent and hypersequent calculi. This allows for the automat...

Agata Ciabattoni, Nikolaos Galatos, Kazushige Teru...

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	200	From Axioms to Analytic Rules in Nonclassical Logics	claim
2	167	Collapsible Pushdown Automata and Recursion Schemes	claim
3	151	Cut Elimination for Monomial MALL Proof Nets	claim
4	148	Correctness of Multiplicative Additive Proof Structures is NL-Complete	claim
5	142	Hiding Local State in Direct Style: A Higher-Order Anti-Frame Rule	claim
6	139	Caterpillar Duality for Constraint Satisfaction Problems	claim
7	136	A Logic for Algebraic Effects	claim
8	130	Winning Regions of Higher-Order Pushdown Games	claim
9	129	From Automatic Structures to Borel Structures	claim
10	129	Focusing on Binding and Computation	claim
11	126	An Algebraic Process Calculus	claim
12	123	On the Axiomatizability of Impossible Futures: Preorder versus Equivalence	claim
13	122	On the Expressiveness and Decidability of Higher-Order Process Calculi	claim
14	119	Context Matching for Compressed Terms	claim
15	116	On the Asymptotic Nullstellensatz and Polynomial Calculus Proof Complexity	claim
16	114	Nonlocal Flow of Control and Kleene Algebra with Tests	claim
17	112	Mechanizing the Metatheory of LF	claim
18	107	A Neutral Approach to Proof and Refutation in MALL	claim
19	107	The Quest for a Logic Capturing PTIME	claim
20	107	The Axiomatic Derivation of Absolute Lower Bounds	claim
21	106	Typed Normal Form Bisimulation for Parametric Polymorphism	claim
22	104	Types for Hereditary Permutators	claim
23	103	On the Expressiveness and Complexity of Randomization in Finite State Monitors	claim
24	98	On the Computational Complexity of Cut-Reduction	claim
25	95	Piecewise Testable Tree Languages	claim
26	95	Structural Logical Relations	claim
27	93	A Logical Characterization of Individual-Based Models	claim
28	88	Reachability Games and Game Semantics: Comparing Nondeterministic Programs	claim
29	86	Weak Topology and a Differentiable Operator for Lipschitz Maps	claim
30	85	The Ordinal Recursive Complexity of Lossy Channel Systems	claim
31	77	Parameterization as Abstraction: A Tractable Approach to the Dataflow Analysis of Concurrent Programs	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers