Naturalism, scientism and the independence of epistemology

Naturalists seek continuity between epistemology and science. Critics argue this illegitimately expands science into epistemology and commits the fallacy of scientism. Must naturalists commit this fallacy? I defend a conception of naturalized epistemology which upholds the non-identity of epistemic ends, norms, and concepts with scientific evidential ends, norms, and concepts. I argue it enables naturalists to avoid three leading scientistic fallacies: dogmatism, one dimensionalism, and granting science an epistemic monopoly.     

On superintuitionistic logics as fragments of proof logic extensions

Coming fromI andCl, i.e. from intuitionistic and classical propositional calculi with the substitution rule postulated, and using the sign to add a new connective there have been considered here: Grzegorozyk's logicGrz, the proof logicG and the proof-intuitionistic logicI set up correspondingly by the calculiFor any calculus we denote by the set of all formulae of the calculus and by the lattice of all logics that are the extensions of the logic of the calculus, i.e. sets of formulae containing the axioms of and closed with respect to its rules of inference. In the logiclG the sign is decoded as follows: A = (A & A). The result of placing in the formulaA before each of its subformula is denoted byTrA. The maps are defined (in the definitions of x and the decoding of is meant), by virtue of which the diagram is constructedIn this diagram the maps, x and are isomorphisms, thereforex ^–1 = ; and the maps and are the semilattice epimorphisms that are not commutative with lattice operation +. Besides, the given diagram is commutative, and the next equalities take place: ^–1 = ^–1 and = ^–1 x. The latter implies in particular that any superintuitionistic logic is a superintuitionistic fragment of some proof logic extension.     

On a certain class ofm-address machines

Conclusion It follows from the proved theorems that ifM =Q, (whereQ={0,q ₁,q ₂,...,q }) is a machine of the classM _F then there exist machinesM _i such thatM _i(1,c)=M (q _i,c) andQ _i={0, 1, 2, ..., +1} (i=1, 2, ..., ).And thus, if the way in which to an initial function of content of memorycC a machine assigns a final onecC is regarded as the only essential property of the machine then we can deal with the machines of the formM ={0, 1, 2, ..., }, and processes (t) (wheret=1,c,cC) only.Such approach can simplify the problem of defining particular machines of the classM _F , composing and simplifying them.Allatum est die 19 Januarii 1970     

A semantical investigation into Leśniewski's axiom of his ontology

A structure A for the language L, which is the first-order language (without equality) whose only nonlogical symbol is the binary predicate symbol , is called a quasi -struoture iff (a) the universe A of A consists of sets and (b) a b is true in A ([p) a = {p } & p b] for every a and b in A, where a(b) is the name of a (b). A quasi -structure A is called an -structure iff (c) {p } A whenever p a A. Then a closed formula in L is derivable from Leniewski's axiom x, y[x y u (u x) u; v(u, v x u v) u(u x u y)] (from the axiom x, y(x y x x) x, y, z(x y z y x z)) iff is true in every -structure (in every quasi -structure).     

Once More into the Breach of Self-Ownership: Reply to Narveson and Brenkert

In reply to Narveson, I distinguish his no-proviso argument from his liberty argument, and I show that both fail. I also argue that interference lacks the strategic status he assigns to it, because it cannot be appropriately distinguished, conceptually and morally, from prevention; that natural resources do enjoy the importance he denies they have; that laissez-faire economies lack the superiority he attributes to them; that ownership can indeed be a reflexive relation; that anti-paternalism does not entail libertarianism; and that he misrepresents the doctrines of a number of philosophers, including John Locke, Ronald Dworkin, and myself. In reply to Brenkert, I show that he seriously misconstrues my view of the nature of freedom, and of its relationship to self-ownership. I then refute his criticisms of my treatment of the contrasts between self-ownership, on the one hand, and autonomy and non-slavery, on the other. I also show that his attempt to exorcize the demon of self-ownership is multiply flawed.     

Логистическая система, исходными связками которой являются эквивалентность и дизъюнкция

- Allatum est die 5 Martii 1970     

Three prepositional calculi of probability

Attempts are made to transform the basis of elementary probability theory into the logical calculus.We obtain the propositional calculus NP by a naive approach. As rules of transformation, NP has rules of the classical propositional logic (for events), rules of the ukasiewicz logic ₀ (for probabilities) and axioms of probability theory, in the form of rules of inference. We prove equivalence of NP with a fragmentary probability theory, in which one may only add and subtract probabilities.The second calculus MP is a usual modal propositional calculus. It has the modal rules x x, x y x y, x x, x y (y x), (y x), in addition to the rules of classical propositional logic. One may read x as x is probable. Imbeddings of NP and of ₀ into MP are given.The third calculus P is a modal extension of ₀. It may be obtained by adding the rule ((xy)y) xy to the modal logic of quantum mechanics Q [5]. One may read x in P as x is observed. An imbedding of NP into P is given.     

On a new property of partially balanced association schemes useful in psychometric structural analysis

In an earlier paper [Psychometrika,31, 1966, p. 147], Srivastava obtained a test for the HypothesisH ₀ : = ₀₀ + ... + _ll, where i are known matrices,i are unknown constants and is the unknown (p ×p) covariance matrix of a random variablex (withp components) having ap-variate normal distribution. The test therein was obtained under (p ×p) covariance matrix of a random variablex (withp components) the condition that ₀, ₁, ..., l form a commutative linear associative algebra and a certain vector, dependent on these, has non-negative elements. In this paper it is shown that this last condition is always satisfied in the special situation (of importance in structural analysis in psychometrics) where ₀, ₁, ..., l are the association matrices of a partially balanced association scheme.This research was partially supported by the U. S. Air Force under Grant No. AF33(615)-3231, monitored by the Aero Space Research Labs.Now at Colorado State University.     

A Translation of Intuitionistic Predicate Logic into Basic Predicate Logic

Basic Predicate Logic, BQC, is a proper subsystem of Intuitionistic Predicate Logic, IQC. For every formula in the language {, , , , , , }, we associate two sequences of formulas 0,1,... and 0,1,... in the same language. We prove that for every sequent , there are natural numbers m, n, such that IQC , iff BQC n m. Some applications of this translation are mentioned.     

Action incompleteness

The author has previously introduced an operator into dynamic logic which takes formulae to terms; the suggested reading of A was the bringing about of A or the seeing to it that A. After criticism from S. K. Thomason and T. J. Surendonk the author now presents an improved version of his theory. The crucial feature is the introduction of an operatorOK taking terms to formulae; the suggested reading of OK is always terminates.     

O pojęciu zdania analitycznego

Rezultaty przedstawione w pracy niniejszej pokrywaj si czciowo z wynikami osignitymi przezR. Wójcickiego w pracy:Analityczne komponenty definicji arbitralnych. Studia Logica, t. XIV. Dotyczy to gównie rezultatów zawartych w czci pierwszej. Chciabym podkreli, i wyniki R. Wójcickiego uzyskane zostay cakowicie niezalenie od rezultatów przedstawionych w pracy obecnej.Allatum est die 16 Aprilis 1962     

Utility theory with inexact preferences and degrees of preference

a–b* c–d is taken to mean that your degree of preference for a over b is less than your degree of preference for c over d. Various properties of the strength-of-preference comparison relation * are examined along with properties of simple preferences defined from *. The investigation recognizes an individual's limited ability to make precise judgments. Several utility theorems relating a–b * c–d to u(a)–u(b) are included.     

Cut-free tableau calculi for some propositional normal modal logics

We give sound and complete tableau and sequent calculi for the prepositional normal modal logics S4.04, K4B and G ⁰(these logics are the smallest normal modal logics containing K and the schemata A A, A A and A ( A); A A and AA; A A and ((A A) A) A resp.) with the following properties: the calculi for S4.04 and G ⁰are cut-free and have the interpolation property, the calculus for K4B contains a restricted version of the cut-rule, the so-called analytical cut-rule.In addition we show that G ⁰is not compact (and therefore not canonical), and we proof with the tableau-method that G ⁰is characterised by the class of all finite, (transitive) trees of degenerate or simple clusters of worlds; therefore G ⁰is decidable and also characterised by the class of all frames for G ⁰.Research supported by Fonds zur Förderung der wissenschaftlichen Forschung, project number P8495-PHY.Presented by W. Rautenberg     

Parameter estimation in latent trait models

Latent trait models for binary responses to a set of test items are considered from the point of view of estimating latent trait parameters=( ₁, , _n ) and item parameters=( ₁, , _k ), where _j may be vector valued. With considered a random sample from a prior distribution with parameter, the estimation of (, ) is studied under the theory of the EM algorithm. An example and computational details are presented for the Rasch model.This work was supported by Contract No. N00014-81-K-0265, Modification No. P00002, from Personnel and Training Research Programs, Psychological Sciences Division, Office of Naval Research. The authors wish to thank an anonymous reviewer for several valuable suggestions.     

Three views of demonstrative reference

Three views of demonstrative reference are examined: contextual, intentional, and quasi-intentional. According to the first, such reference is determined entirely by certain publicly accessible features of the context. According to the second, speaker intentions are criterial in demonstrative reference. And according to the third, both contextual features and intentions come into play in the determination of demonstrative reference. The first two views (both of which enjoy current popularity) are rejected as implausible; the third (originally proposed by Kaplan in Dthat) is argued to be highly plausible.     

Derivation of likelihood-ratio tests for Guttman quasi-simplex covariance structures

In this paper, maximum-likelihood estimates have been obtained for covariance matrices which have the Guttman quasi-simplex structure under each of the following null hypotheses: (a) The covariance matrix , can be written asTT + where and are both diagonal matrices with unknown elements andT is a known lower triangular matrix, and (b) the covariance matrix *, is expressible asT*T + I where is an unknown scalar. The linear models from which these covariance structures arise are also stated along with the underlying assumptions. Two likelihood-ratio tests have been constructed, one each for the above null hypotheses, against the alternative hypothesis that the population covariance matrix is simply positive definite and has no particular pattern. A numerical example is provided to illustrate the test procedure. Possible applications of the proposed test are also suggested.Adapted from portions of the author's dissertation under the same title submitted to the Department of Psychology, University of North Carolina, in partial fulfillment of the requirements for the Ph.D. degree. The author wishes to express his gratitude to his thesis chairman Dr. R. Darrell Bock and to his committee members Professors Samarendra Nath Roy, Lyle V. Jones, Thelma G. Thurstone, and Dorothy Adkins. Indebtedness is also acknowledged to Dr. Somesh Das Gupta who was quite helpful during the initial stage of the study.Formerly at the Department of Psychology, Indiana University. The author is grateful both to Indiana University and University of North Carolina for the support extended to him during his doctoral studies.     

Paradoxical consequences of Balzer''s and G?hde''s criteria of theoreticity. Results of an application to ten scientific theories

It is shown that the criteria of T-theoreticity proposed by Balzer and Gähde lead to strongly counterintuitive and in this sense paradoxical results: most of the obviously empirical or at least nontheoretical terms come out as theoretical. This is demonstrated for a lot of theories in different areas. On the way, some improved and some new structuralist theory-reconstructions are given. The conclusion is drawn that the T-theoreticity of a term cannot possibly be proved on the basis of the mathematical structure of theory T alone (as Gähde and Balzer suggest). Rather, an independent notion of pre-T-theoreticity and-more importantly-of empiricity is needed; i.e., not empirical and not pre-T-theoretical are independent, necessary but not sufficient conditions for T-theoretical (this is also a necessary complement of Sneed's original criterion). Finally it is asked whether the structuralist criterion of T-theoreticity complemented by such independent conditions would be a satisfactory answer to Putnam's challenge, and the answer again is negative: the criterion is not able to distinguish between empirically contentful and completely contentless (superfluous) theoretical terms.     

Kenneth Strike on Liberalism,Citizenship and the Private Interest in Schooling

After indicating a number of points of agreement with the argument 0eveloped by Kenneth Strike in his article Liberalism, Citizenship and the Private Interest in Schooling, this article identifies and explores a number of queries and criticisms which arise in relation to that argument. These queries and criticisms relate especially to the nature and extent of the expansiveness involved in Strike's conception of public or common educational influence, and to the implications and justification of the claim that private educational interests enjoy a greater salience and recognition on Strike's view of public or common educational influence than on some alternative views.     

Rules in relevant logic — II: Formula representation

This paper surveys the various forms of Deduction Theorem for a broad range of relevant logics. The logics range from the basic system B of Routley-Meyer through to the system R of relevant implication, and the forms of Deduction Theorem are characterized by the various formula representations of rules that are either unrestricted or restricted in certain ways. The formula representations cover the iterated form,A ₁ .A ₂ . ... .A _n B, the conjunctive form,A ₁&A ₂ & ...A _n B, the combined conjunctive and iterated form, enthymematic version of these three forms, and the classical implicational form,A ₁&A ₂& ...A _n B. The concept of general enthymeme is introduced and the Deduction Theorem is shown to apply for rules essentially derived using Modus Ponens and Adjunction only, with logics containing either (A B)&(B C) .A C orA B .B C .A C.I acknowledge help from anonymous referees for guidance in preparing Part II, and especially for the suggestion that Theorem 9 could be expanded to fully contraction-less logics.