APAL 2010 - PDF Preprint Papers

APAL 2010

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed APAL-2010 Paper

click to vote

APAL
2010

175views more APAL 2010»

Admissible rules in the implication-negation fragment of intuitionistic logic

14 years 20 days ago

Download www.math.unibe.ch

Petr Cintula, George Metcalfe

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	175	Admissible rules in the implication-negation fragment of intuitionistic logic	claim
2	141	Locatedness and overt sublocales	claim
3	130	Fundamental results for pointfree convex geometry	claim
4	129	Kripke models for classical logic	claim
5	125	The computable Lipschitz degrees of computably enumerable sets are not dense	claim
6	124	The effective theory of Borel equivalence relations	claim
7	123	Cut elimination and strong separation for substructural logics: An algebraic approach	claim
8	123	Classical descriptive set theory as a refinement of effective descriptive set theory	claim
9	117	The complexity of temporal logic over the reals	claim
10	117	Club-guessing, stationary reflection, and coloring theorems	claim
11	115	Kripke semantics for provability logic GLP	claim
12	114	Classical predicative logic-enriched type theories	claim
13	113	Logic for update products and steps into the past	claim
14	111	Resource modalities in tensor logic	claim
15	98	Classical proof forestry	claim
16	97	A modal logic framework for reasoning about comparative distances and topology	claim
17	97	Beyond Borel-amenability: Scales and superamenable reducibilities	claim
18	97	The free n-generated BL-algebra	claim
19	96	Light Dialectica revisited	claim
20	93	A measure-theoretic proof of Turing incomparability	claim
21	93	Edge distribution and density in the characteristic sequence	claim
22	92	The eskolemization of universal quantifiers	claim
23	90	Canonical extensions for congruential logics with the deduction theorem	claim
24	88	Nonstandard arithmetic and recursive comprehension	claim
25	85	Elementary differences between the degrees of unsolvability and degrees of compressibility	claim
26	83	Truth in generic cuts	claim
27	83	Forcing absoluteness and regularity properties	claim
28	81	Proof and refutation in MALL as a game	claim
29	79	On lovely pairs of geometric structures	claim
30	79	Martin's Axiom and embeddings of upper semi-lattices into the Turing degrees	claim
31	78	Extending and interpreting Post's programme	claim
32	78	Generic embeddings associated to an indestructibly weakly compact cardinal	claim
33	78	Unprovability threshold for the planar graph minor theorem	claim
34	75	Global singularization and the failure of SCH	claim
35	73	Totality in arena games	claim
36	71	On some definable sets over fields with analytic structure	claim
37	70	Locally definable homotopy	claim
38	69	Relativized Grothendieck topoi	claim
39	69	Cardinal sequences of LCS spaces under GCH	claim
40	68	Cardinal characteristics and projective wellorders	claim
41	68	Higher Kurtz randomness	claim
42	68	Spaces of orders and their Turing degree spectra	claim
43	67	The strength of sharply bounded induction requires MSP	claim
44	67	Projective mad families	claim
45	66	Strong normalization results by translation	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers