It is well known that every closure system can be represented by an implicational base, or the set of its meet-irreducible elements. In Horn logic, these are respectively as expressions and characteristic models. this paper, we consider problem translating between two representations in acyclic convex geometries. Quite surprisingly, show context already harder than dualization distributive latt...

background: tricyclic antidepressants (tcas) poisoning is the most common poisoning in the poisoning emergency department of noor hospital, isfahan, iran. the objective of this study was to compare qrs interval duration with ravr³3mm and r/savr³ 0.7 in predicting: serious complications of acute tca toxicity. methods and materials: this study was descriptive – analytic and prospective cohort. tc...

An abstract framework of canonical inference based on proof orderings is applied to ground Horn theories with equality. A finite presentation that makes all normal-form proofs available is called saturated. To maximize the chance that a saturated presentation be finite, it should also be contracted, in which case it is deemed canonical. We apply these notions to propositional Horn theories – or...

The complexity of a mental disorder such as depression is such that a way of interlinking the neural, mental and interpersonal levels is needed. This paper proposes that a theoretical framework which distinguishes, and relates, macro-theory and micro-theory at these levels can serve this purpose. The 'Interacting Cognitive Subsystems' approach to mental architecture is used to show how, via the...

0. Introduction The overall aim of this paper is to present a speech act ontology that is motivated by general assumptions about the nature of human language and implicational universals about the grammatical coding of illocutionary force (sentence mood markers). In particular, I want to show five things: First, that the Searlean picture is skewed in that it misrepresents universally attested d...

We discuss paradoxes of implication in the setting of a proof-conditional theory of meaning for logical constants. We argue that a proper logic of implication should be not only relevant, but also constructive and nonmonotonic. This leads us to select as a plausible candidate LL, a fragment of linear logic which differs from R in that it rejects both contraction and

We show that every optimum basis of a finite closure system, in D. Maier’s sense, is also right-side optimum, which is a parameter of a minimum CNF representation of a Horn Boolean function. New parameters for the size of the binary part are also established. We introduce the K-basis of a general closure system, which is a refinement of the canonical basis of V. Duquenne and J.L. Guigues, and d...

We use an alternative graphical representation for formulas in implicational intuitionistic logic in order to obtain and demonstrate results concerning provability. We demonstrate the adequateness of the method in this area, showing that one can easily recognize and prove new results and simplify the proofs of others. As such, we extend a known class of formulas for which uniqueness of -normal ...

In posing the sense of 'Rightness' as a quality-of-processing measure, Mangan runs the risk of a homuncular argument, since some process needs to observe Rightness, as well as the sensory qualia. Interacting Cognitive Subsystems (ICS) is an information processing account of cognitive activity that is concordant with Mangan's arguments, but which avoids the need for any supervisory system or cen...

About 50 years ago Lukasiewicz, Tarski, see 6, 4] and others studied the implicational calculus, i. e. the set PIF (pure implicational formulas) of those propositional formulas that are constructed exclusively from Boolean variables and the propositional implication ! as the only connective. Obviously this class of formulas is not able to represent all Boolean functions. While every formula in ...