APAL 2008 - PDF Preprint Papers

APAL 2008

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed APAL-2008 Paper

click to vote

APAL
2008

159views more APAL 2008»

Approximations of modal logics: K and beyond

13 years 4 months ago

Download www.ime.usp.br

Inspired by recent work on approximations of classical logic, we present a method that approximates several modal logics in a modular way. Our starting point is the limitation of ...

Guilherme de Souza Rabello, Marcelo Finger

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	Approximations of modal logics: K and beyond	claim
2	112	A domain model characterising strong normalisation	claim
3	111	Cut elimination for a simple formulation of epsilon calculus	claim
4	104	Infinite trace equivalence	claim
5	104	Atomic models higher up	claim
6	102	Partial automorphism semigroups	claim
7	96	On superstable CSA-groups	claim
8	95	The associated sheaf functor theorem in algebraic set theory	claim
9	95	Cartesian closed Dialectica categories	claim
10	94	Aspects of predicative algebraic set theory I: Exact completion	claim
11	93	Arithmetic of Dedekind cuts of ordered Abelian groups	claim
12	92	The complexity of random ordered structures	claim
13	90	On the unity of duality	claim
14	88	Stochastic coalgebraic logic: Bisimilarity and behavioral equivalence	claim
15	87	Characterising nested database dependencies by fragments of propositional logic	claim
16	84	Resolution over linear equations and multilinear proofs	claim
17	83	Easton's theorem and large cardinals	claim
18	81	A remark on equivalent Rosser sentences	claim
19	80	A quantified logic of evidence	claim
20	80	System BV is NP-complete	claim
21	79	Parameter-free polymorphic types	claim
22	79	Intermediate logics and factors of the Medvedev lattice	claim
23	78	Strong normalization of classical natural deduction with disjunctions	claim
24	77	More on SOP1 and SOP2	claim
25	75	Call-by-name reduction and cut-elimination in classical logic	claim
26	72	A semi-linear group which is not affine	claim
27	69	Lowness properties and approximations of the jump	claim
28	67	Proof nets sequentialisation in multiplicative linear logic	claim
29	65	Vaught's conjecture for superstable theories of finite rank	claim
30	63	A standard model of Peano arithmetic with no conservative elementary extension	claim
31	63	The nonstandard quantum plane	claim
32	62	The upward closure of a perfect thin class	claim
33	62	Superrosy dependent groups having finitely satisfiable generics	claim
34	61	Second-order type isomorphisms through game semantics	claim
35	59	Introduction to Turing categories	claim
36	56	A game semantics of names and pointers	claim
37	55	What is o-minimality?	claim
38	49	A note on a theorem of Ax	claim
39	45	A sequent calculus for limit computable mathematics	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers