A Closer Look at Some Subintuitionistic Logics
نویسندگان
چکیده
منابع مشابه
A Closer Look at Some Subintuitionistic Logics
In the present paper we study systematically several consequence relations on the usual language of propositional intuitionistic logic that can be defined semantically by using Kripke frames and the same defining truth conditions for the connectives as in intuitionistic logic but without imposing some of the conditions on the Kripke frames that are required in the intuitionistic case. The logic...
متن کاملSubintuitionistic Logics
Weakening the conditions on the Kripke semantics for propositional intuitionistic logic (J) unearths a family of logics below J. This paper provides a characterization of eleven such logics, using Kripke semantics, proof theory, and algebraic models. Questions about modelling quantification in these logics are also discussed.
متن کاملWeak subintuitionistic logics
A system WF of subintuitionistic logic is introduced, weaker than Corsi’s basic subintuitionistic system F. A derivation system with and without hypotheses is given in line with the authors’ derivation system for F. A neighborhood semantics is introduced with a somewhat more complex definition than the neighborhood semantics for non-normal modal logics. Completeness is proved for WF with respec...
متن کاملA Closer Look at Preduction
In a recent paper Jun Arima formalises the idea of preduc-tion { a non-monotonic schema providing a common basis for inductive and analogical reasoning. We examine some of the implications of this schema, as well as its connections with prototypes and conceptual spaces. A generalised version of his schema is motivated and developed to address diiculties with asymmetry and disjuncts.
متن کاملA Closer Look at HMAC
Bellare, Canetti and Krawczyk [BCK96] show that cascading an ε-secure (fixed input length) PRF gives an O(εnq)-secure (variable input length) PRF when making at most q prefix-free queries of length n blocks. We observe that this translates to the same bound for NMAC (which is the cascade without the prefix-free requirement but an additional application of the PRF at the end), and give a matchin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 2001
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1063372244