APAL 2005 - PDF Preprint Papers

APAL 2005

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed APAL-2005 Paper

click to vote

APAL
2005

154views more APAL 2005»

A Sahlqvist theorem for distributive modal logic

13 years 4 months ago

Download staff.science.uva.nl

In this paper we consider distributive modal logic, a setting in which we may add modalities, such as classical types of modalities as well as weak forms of negation, to the fragm...

Mai Gehrke, Hideo Nagahashi, Yde Venema

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	154	A Sahlqvist theorem for distributive modal logic	claim
2	135	Safe beliefs for propositional theories	claim
3	125	Dynamic topological logic	claim
4	119	Elementary arithmetic	claim
5	117	About cut elimination for logics of common knowledge	claim
6	115	Completeness of S4 with respect to the real line: revisited	claim
7	107	Uniform Heyting arithmetic	claim
8	97	Polarized and focalized linear and classical proofs	claim
9	93	Logical aspects of Cayley-graphs: the group case	claim
10	90	Explicit mathematics: power types and overloading	claim
11	89	Softness of hypercoherences and MALL full completeness	claim
12	88	Completing pseudojump operators	claim
13	88	Dependence relations in computably rigid computable vector spaces	claim
14	87	Stability in geometric theories	claim
15	86	Control structures in programs and computational complexity	claim
16	83	Reflections on reflections in explicit mathematics	claim
17	82	A descending chain condition for groups definable in o-minimal structures	claim
18	82	Forcing indestructibility of MAD families	claim
19	79	Abstract State Machines: a unifying view of models of computation and of system design frameworks	claim
20	78	The logic of proofs, semantically	claim
21	76	Linear realizability and full completeness for typed lambda-calculi	claim
22	73	Finite information logic	claim
23	71	Upper and lower Ramsey bounds in bounded arithmetic	claim
24	67	The minimal e-degree problem in fragments of Peano arithmetic	claim
25	67	Free abelian lattice-ordered groups	claim
26	62	Separation results for the size of constant-depth propositional proofs	claim
27	62	A proof of topological completeness for S4 in (0, 1)	claim
28	57	Enumerations in computable structure theory	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers