Some Useful 16-Valued Logics: How a Computer Network Should Think

In Belnaps useful 4-valued logic, the set 2={T,F} of classical truth values is generalized to the set 4=(2)={,{T},{F},{T,F}}. In the present paper, we argue in favor of extending this process to the set 16=(4) (and beyond). It turns out that this generalization is well-motivated and leads from the bilattice FOUR₂ with an information and a truth-and-falsity ordering to another algebraic structure, namely the trilattice SIXTEEN₃ with an information ordering together with a truth ordering and a (distinct) falsity ordering. Interestingly, the logics generated separately by the algebraic operations under the truth order and under the falsity order in SIXTEEN₃ coincide with the logic of FOUR₂, namely first degree entailment. This observation may be taken as a further indication of the significance of first degree entailment. In the present setting, however, it becomes rather natural to consider also logical systems in the language obtained by combining the vocabulary of the logic of the truth order and the falsity order. We semantically define the logics of the two orderings in the extended language and in both cases axiomatize a certain fragment comprising three unary operations: a negation, an involution, and their combination. We also suggest two other definitions of logics in the full language, including a bi-consequence system. In other words, in addition to presenting first degree entailment as a useful 16-valued logic, we define further useful 16-valued logics for reasoning about truth and (non-)falsity. We expect these logics to be an interesting and useful instrument in information processing, especially when we deal with a net of hierarchically interconnected computers. We also briefly discuss Arielis and Avrons notion of a logical bilattice and state a number of open problems for future research.Dedicated to Nuel D. Belnap on the occasion of his 75th Birthday     

A Few More Useful 8-valued Logics for Reasoning with Tetralattice <Emphasis Type="Italic">EIGHT</Emphasis><Subscript>4</Subscript>

In their useful logic for a computer network Shramko and Wansing generalize initial values of Belnap’s 4-valued logic to the set 16 to be the power-set of Belnap’s 4. This generalization results in a very specific algebraic structure — the trilattice SIXTEEN ₃ with three orderings: information, truth and falsity. In this paper, a slightly different way of generalization is presented. As a base for further generalization a set 3 is chosen, where initial values are a — incoming data is asserted, d — incoming data is denied, and u — incoming data is neither asserted nor denied, that corresponds to the answer “don’t know”. In so doing, the power-set of 3, that is the set 8 is considered. It turns out that there are not three but four orderings naturally defined on the set 8 that form the tetralattice EIGHT ₄. Besides three ordering relations mentioned above it is an extra uncertainty ordering. Quite predictably, the logics generated by a–order (truth order) and d–order (falsity order) coincide with first-degree entailment. Finally logic with two kinds of operations (a–connectives and d–connectives) and consequence relation defined via a–ordering is considered. An adequate axiomatization for this logic is proposed.     

On subdirectly irreducible OMAs

In this paper some properties of epi-representations and Schmidt-congruence relations of orthomodular partial algebras are investigated and an infinite list of OMA-epi-subdirectly irreducible orthomodular partial algebras will be constructed.Special issue of Studia Logica: Algebraic Theory of Quasivarieties Presented by M. E. Adams, K. V. Adaricheva, W. Dziobiak, and A. V. Kravchenko     

On the misuse of manifest variables in the detection of measurement bias

Measurement invariance (lack of bias) of a manifest variableY with respect to a latent variableW is defined as invariance of the conditional distribution ofY givenW over selected subpopulations. Invariance is commonly assessed by studying subpopulation differences in the conditional distribution ofY given a manifest variableZ, chosen to substitute forW. A unified treatment of conditions that may allow the detection of measurement bias using statistical procedures involving only observed or manifest variables is presented. Theorems are provided that give conditions for measurement invariance, and for invariance of the conditional distribution ofY givenZ. Additional theorems and examples explore the Bayes sufficiency ofZ, stochastic ordering inW, local independence ofY andZ, exponential families, and the reliability ofZ. It is shown that when Bayes sufficiency ofZ fails, the two forms of invariance will often not be equivalent in practice. Bayes sufficiency holds under Rasch model assumptions, and in long tests under certain conditions. It is concluded that bias detection procedures that rely strictly on observed variables are not in general diagnostic of measurement bias, or the lack of bias.Preparation of this article was supported in part by PSC-CUNY grant #661282 to Roger E. Millsap.     

On the Closure Properties of the Class of Full G-models of a Deductive System

In this paper we consider the structure of the class FGModS of full generalized models of a deductive system S from a universal-algebraic point of view, and the structure of the set of all the full generalized models of S on a fixed algebra A from the lattice-theoretical point of view; this set is represented by the lattice FACS_s A of all algebraic closed-set systems C on A such that (A, C) ε FGModS. We relate some properties of these structures with tipically logical properties of the sentential logic S. The main algebraic properties we consider are the closure of FGModS under substructures and under reduced products, and the property that for any A the lattice FACS_s A is a complete sublattice of the lattice of all algebraic closed-set systems over A. The logical properties are the existence of a fully adequate Gentzen system for S, the Local Deduction Theorem and the Deduction Theorem for S. Some of the results are established for arbitrary deductive systems, while some are found to hold only for deductive systems in more restricted classes like the protoalgebraic or the weakly algebraizable ones. The paper ends with a section on examples and counterexamples. Dedicated to the memory of Willem Johannes Blok     

Do Extrinsic Dispositions Need Extrinsic Causal Bases?

In this paper, I distinguish two often‐conflated theses—the thesis that all dispositions are intrinsic properties and the thesis that the causal bases of all dispositions are intrinsic properties—and argue that the falsity of the former does not entail the falsity of the latter. In particular, I argue that extrinsic dispositions are a counterexample to first thesis but not necessarily to the second thesis, because an extrinsic disposition does not need to include any extrinsic property in its causal basis. I conclude by drawing some general lessons about the nature of dispositions and their relation to their causal bases.     

Logical Connectives on Lattice Effect Algebras

An effect algebra is a partial algebraic structure, originally formulated as an algebraic base for unsharp quantum measurements. In this article we present an approach to the study of lattice effect algebras (LEAs) that emphasizes their structure as algebraic models for the semantics of (possibly) non-standard symbolic logics. This is accomplished by focusing on the interplay among conjunction, implication, and negation connectives on LEAs, where the conjunction and implication connectives are related by a residuation law. Special cases of LEAs are MV-algebras and orthomodular lattices. The main result of the paper is a characterization of LEAs in terms of so-called Sasaki algebras. Also, we compare and contrast LEAs, Hájek??s BL-algebras, and the basic algebras of Chajda, Hala?, and Kühr.     

Betting on conditionals

A study is reported testing two hypotheses about a close parallel relation between indicative conditionals, if A then B, and conditional bets, I bet you that if A then B. The first is that both the indicative conditional and the conditional bet are related to the conditional probability, P(B|A). The second is that de Finetti's three-valued truth table has psychological reality for both types of conditional—true, false, or void for indicative conditionals and win, lose, or void for conditional bets. The participants were presented with an array of chips in two different colours and two different shapes, and an indicative conditional or a conditional bet about a random chip. They had to make judgements in two conditions: either about the chances of making the indicative conditional true or false or about the chances of winning or losing the conditional bet. The observed distributions of responses in the two conditions were generally related to the conditional probability, supporting the first hypothesis. In addition, a majority of participants in further conditions chose the third option, “void”, when the antecedent of the conditional was false, supporting the second hypothesis.     

Orthoimplication algebras

Orthologic is defined by weakening the axioms and rules of inference of the classical propositional calculus. The resulting Lindenbaum-Tarski quotient algebra is an orthoimplication algebra which generalizes the author's implication algebra. The associated order structure is a semi-orthomodular lattice. The theory of orthomodular lattices is obtained by adjoining a falsity symbol to the underlying orthologic or a least element to the orthoimplication algebra.Allatum est die 1 Julii 1975     

On Axiomatizing Shramko-Wansing’s Logic

This work treats the problem of axiomatizing the truth and falsity consequence relations, ⊨ _t and ⊨ _f , determined via truth and falsity orderings on the trilattice SIXTEEN ₃ (Shramko and Wansing, 2005). The approach is based on a representation of SIXTEEN ₃ as a twist-structure over the two-element Boolean algebra.     

The relationship between dietary restraint and deficits in reasoning about causes of obesity

Abstract

Objective: Increased levels of dietary restraint are associated with deficits on many cognitive tasks. Less is known about how individual differences in restraint influences complex cognition such as reasoning which is the focus of this research.

Design: Two experimental studies are reported. In study 1, participants (n?=?158) completed a causal conditional reasoning task with statements about weight-related and general causal relationships. Study 2 replicated and extended study 1. Participants (n?=?108) completed a causal conditional reasoning task focusing on behavioural causes of weight change or general statements.

Main outcome measure: Causal conditional reasoning task performance.

Results: In study 1, levels of dietary restraint were negatively associated with reasoning abilities for weight-related statements only. Study 2 replicated the negative association between dietary restraint and reasoning finding the effect in both weight-related, and general, causal judgements.

Conclusion: The novel findings show that individual differences in dietary restraint have a wider relationship with cognition than previously demonstrated. Results tentatively support theoretical explanations of a reduction in cognitive capacity, rather than differences in belief, explaining reasoning deficits. These findings open an interesting avenue for research and might have implications for effective decision making about personal health behaviours, such as food choice.     

Quadratic prediction of factor scores

Factor scores are naturally predicted by means of their conditional expectation given the indicatorsy. Under normality this expectation is linear iny but in general it is an unknown function ofy. It is discussed that under nonnormality factor scores can be more precisely predicted by a quadratic function ofy.The authors would like to thank Edith Nijenhuis, the anonymous referees, and the associate editor for their helpful comments and suggestions.     

Algebras of Intervals and a Logic of Conditional Assertions

Intervals in boolean algebras enter into the study of conditional assertions (or events) in two ways: directly, either from intuitive arguments or from Goodman, Nguyen and Walker's representation theorem, as suitable mathematical entities to bear conditional probabilities, or indirectly, via a representation theorem for the family of algebras associated with de Finetti's three-valued logic of conditional assertions/events. Further representation theorems forge a connection with rough sets. The representation theorems and an equivalent of the boolean prime ideal theorem yield an algebraic completeness theorem for the three-valued logic. This in turn leads to a Henkin-style completeness theorem. Adequacy with respect to a family of Kripke models for de Finetti's logic, ukasiewicz's three-valued logic and Priest's Logic of Paradox is demonstrated. The extension to first-order yields a short proof of adequacy for Körner's logic of inexact predicates.     

The representation of Takeuti's\begin{array}{*{20}c} \parallel \\ \_ \\ \end{array} -operator

Gaisi Takeuti has recently proposed a new operation on orthomodular latticesL, \(\begin{array}{*{20}c} \parallel \\ \_ \\ \end{array} \) :P(L)»L. The properties of \(\begin{array}{*{20}c} \parallel \\ \_ \\ \end{array} \) suggest that the value of \(\begin{array}{*{20}c} \parallel \\ \_ \\ \end{array} \) (A) (A) \( \subseteq \) L) corresponds to the degree in which the elements ofA behave classically. To make this idea precise, we investigate the connection between structural properties of orthomodular latticesL and the existence of two-valued homomorphisms onL.     

A Non-Inferentialist, Anti-Realistic Conception of Logical Truth and Falsity

Anti-realistic conceptions of truth and falsity are usually epistemic or inferentialist. Truth is regarded as knowability, or provability, or warranted assertability, and the falsity of a statement or formula is identified with the truth of its negation. In this paper, a non-inferentialist but nevertheless anti-realistic conception of logical truth and falsity is developed. According to this conception, a formula (or a declarative sentence) A is logically true if and only if no matter what is told about what is told about the truth or falsity of atomic sentences, A always receives the top-element of a certain partial order on non-ontic semantic values as its value. The ordering in question is a told-true order. Analogously, a formula A is logically false just in case no matter what is told about what is told about the truth or falsity of atomic sentences, A always receives the top-element of a certain told-false order as its value. Here, truth and falsity are pari passu, and it is the treatment of truth and falsity as independent of each other that leads to an informational interpretation of these notions in terms of a certain kind of higher-level information.     

Dual Intuitionistic Logic and a Variety of Negations: The Logic of Scientific Research

We consider a logic which is semantically dual (in some precise sense of the term) to intuitionistic. This logic can be labeled as “falsification logic”: it embodies the Popperian methodology of scientific discovery. Whereas intuitionistic logic deals with constructive truth and non-constructive falsity, and Nelson's logic takes both truth and falsity as constructive notions, in the falsification logic truth is essentially non-constructive as opposed to falsity that is conceived constructively. We also briefly clarify the relationships of our falsification logic to some other logical systems.     

Some paraconsistent sentential calculi

In [8] Jakowski defined by means of an appropriate interpretation a paraconsistent calculusD ₂ . In [9] J. Kotas showed thatD ₂ is equivalent to the calculusM(S5) whose theses are exactly all formulasa such thatMa is a thesis ofS5. The papers [11], [7], [3], and [4] showed that interesting paraconsistent calculi could be obtained using modal systems other thanS5 and modalities other thanM. This paper generalises the above work. LetA be an arbitrary modality (i.e. string ofM's,L's and negation signs). Then theA-extension of a set of formulasX is {¦A X}}. Various properties ofA-extensions of normal modal systems are examined, including a problem of their axiomatizability     

The Power of Belnap: Sequent Systems for <Emphasis Type="BoldItalic">SIXTEEN</Emphasis><Subscript><Emphasis Type="Bold">3</Emphasis></Subscript>

The trilattice SIXTEEN₃\textit{SIXTEEN}_3 is a natural generalization of the well-known bilattice FOUR₂\textit{FOUR}_2. Cut-free, sound and complete sequent calculi for truth entailment and falsity entailment in SIXTEEN₃\textit{SIXTEEN}_3 are presented.     

Internal approach to external sets and universes

In this article we show how the universe ofBST,bounded set theory (a modification ofIST which is, briefly, a theory for the family of those sets inIST which are members of standard sets) can be enlarged by definable subclasses of sets (which are not necessarily sest in internal theories likeBST orIST) so that Separation and Replacement are true in the enlargement for all formulas, including those in which the standardness predicate may occur.ThusBST is strong enough to incorporate external sets in the internal universe in a way sufficient to develop topics in nonstandard analysis inaccessible in the framework of a purely internal approach, such as Loeb measures.Presented byRobert Goldblatt     

Graphical regression models for polytomous variables

When modeling the relationship between two nominal categorical variables, it is often desirable to include covariates to understand how individuals differ in their response behavior. Typically, however, not all the relevant covariates are available, with the result that the measured variables cannot fully account for the associations between the nominal variables. Under the assumption that the observed and unobserved variables follow a homogeneous conditional Gaussian distribution, this paper proposesRC(M) regression models to decompose the residual associations between the polytomous variables. Based on Goodman's (1979, 1985)RC(M) association model, a distinctive feature ofRC(M) regression models is that they facilitate the joint estimation of effects due to manifest and omitted (continuous) variables without requiring numerical integration. TheRC(M) regression models are illustrated using data from the High School and Beyond study (Tatsuoka & Lohnes, 1988). This article was accepted for publication, when Willem J. Heiser was the Editor ofPsychometrika. This research was supported by grants from the National Science Foundation (#SBR96-17510 and #SBR94-09531) and the Bureau of Educational Research at the University of Illinois. We thank Jee-Seon Kim for comments and computational assistance.