A reduction rule for Peirce formula

A reduction rule is introduced as a transformation of proof figures in implicational classical logic. Proof figures are represented as typed terms in a -calculus with a new constant P ⁽⁽⁾⁾. It is shown that all terms with the same type are equivalent with respect to -reduction augmented by this P-reduction rule. Hence all the proofs of the same implicational formula are equivalent. It is also shown that strong normalization fails for P-reduction. Weak normalization is shown for P-reduction with another reduction rule which simplifies of (( ) ) into an atomic type.This work was partially supported by a Grant-in-Aid for General Scientific Research No. 05680276 of the Ministry of Education, Science and Culture, Japan and by Japan Society for the Promotion of Science. Hiroakira Ono     

Some modifications of Scott's theorem on injective spaces

D. Scott in his paper [5] on the mathematical models for the Church-Curry -calculus proved the following theorem.A topological space X. is an absolute extensor for the category of all topological spaces iff a contraction of X. is a topological space of Scott's open sets in a continuous lattice.In this paper we prove a generalization of this theorem for the category of , -closure spaces. The main theorem says that, for some cardinal numbers , , absolute extensors for the category of , -closure spaces are exactly , -closure spaces of , -filters in , >-semidistributive lattices (Theorem 3.5).If = and = we obtain Scott's Theorem (Corollary 2.1). If = 0 and = we obtain a characterization of closure spaces of filters in a complete Heyting lattice (Corollary 3.4). If = 0 and = we obtain a characterization of closure space of all principial filters in a completely distributive complete lattice (Corollary 3.3).     

On the logic of conscious belief

In this paper we are discussing a version of propositional belief logic, denoted by LB, in which so-called axioms of introspection (B BB and B B B) are added to the usual ones. LB is proved to be sound and complete with respect to Boolean algebras equipped with proper filters (Theorem 5). Interpretations in classical theories (Theorem 4) are also considered. A few modifications of LB are further dealt with, one of which turns out to be S5.     

On a problem of P(α, δ, π) concerning generalized Alexandroff s cube

Universality of generalized Alexandroff's cube plays essential role in theory of absolute retracts for the category of , -closure spaces. Alexandroff's cube. is an , -closure space generated by the family of all complete filters. in a lattice of all subsets of a set of power .Condition P(, , ) says that is a closure space of all , -filters in the lattice ( ), .Assuming that P (, , ) holds, in the paper [2], there are given sufficient conditions saying when an , -closure space is an absolute retract for the category of , -closure spaces (see Theorems 2.1 and 3.4 in [2]).It seems that, under assumption that P (, , ) holds, it will be possible to givean uniform characterization of absolute retracts for the category of , -closure-spaces.Except Lemma 3.1 from [1], there is no information when the condition P (, , ) holds or when it does not hold.The main result of this paper says, that there are examples of cardinal numbers, , , such that P (, , ) is not satisfied.Namely it is proved, using elementary properties of Lebesgue measure on the real line, that the condition P (, ₁, 2 ) is not satisfied.Moreover it is shown that fulfillment of the condition is essential assumption in, Theorems 2.1 and 3.4 from [1] i.e. it cannot be eliminated.     

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 note on the ω-incompleteness formalization

The paper studies two formal schemes related to -completeness.LetS be a suitable formal theory containing primitive recursive arithmetic and letT be a formal extension ofS. Denoted by (a), (b) and (c), respectively, are the following three propositions (where (x) is a formula with the only free variable x): (a) (for anyn) ( _T (n)), (b) _{T x} Pr _T (^–(x)^–) and (c) _T x(x) (the notational conventions are those of Smoryski [3]). The aim of this paper is to examine the meaning of the schemes which result from the formalizations, over the base theoryS, of the implications (b) (c) and (a) (b), where ranges over all formulae. The analysis yields two results overS : 1. the schema corresponding to (b) (c) is equivalent to ¬Cons _T and 2. the schema corresponding to (a) (b) is not consistent with 1-CON _T. The former result follows from a simple adaptation of the -incompleteness proof; the second is new and is based on a particular application of the diagonalization lemma.Presented byMelvin Fitting     

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.     

Algebraic aspects of deduction theorems

The first known statements of the deduction theorems for the first-order predicate calculus and the classical sentential logic are due to Herbrand [8] and Tarski [14], respectively. The present paper contains an analysis of closure spaces associated with those sentential logics which admit various deduction theorems. For purely algebraic reasons it is convenient to view deduction theorems in a more general form: given a sentential logic C (identified with a structural consequence operation) in a sentential language I, a quite arbitrary set P of formulas of I built up with at most two distinct sentential variables p and q is called a uniform deduction theorem scheme for C if it satisfies the following condition: for every set X of formulas of I and for any formulas and , C(X{{a}}) iff P(, ) AC(X). [P(, ) denotes the set of formulas which result by the simultaneous substitution of for p and for q in all formulas in P]. The above definition encompasses many particular formulations of theorems considered in the literature to be deduction theorems. Theorem 1.3 gives necessary and sufficient conditions for a logic to have a uniform deduction theorem scheme. Then, given a sentential logic C with a uniform deduction theorem scheme, the lattices of deductive filters on the algebras A similar to the language of C are investigated. It is shown that the join-semilattice of finitely generated (= compact) deductive filters on each algebra A is dually Brouwerian.A part of this paper was presented in abstracted form in Bulletin of the Section of Logic, Vol. 12, No. 3 (1983), pp. 111–116, and in The Journal of Symbolic Logic.     

The subjective vertical under ‘dry’ and ‘wet’ conditions at clockwise and counterclockwise changed positions and the effect of a parallel-lined background field

Summary The dependence of the subjective vertical (SV, the angle between a subjective vertical line and body median plane) on the gravity vertical (body tilt position, angle ) and on the optical vertical (i.e., a field of parallel lines seen as background to the line to be adjusted) was investigated. The SV was measured under dry and wet conditions at different degrees of body tilt attained in either clockwise (CW) or counterclockwise (CCW) progression.The measured difference in between field-of-lines left and right of the line is smallest at the upright position (=O°) and largest at =150°/165°. All body positions show a -difference between CW and CCW attainment (hysteresis), this too being least at upright and greatest at inverted body positions.These results, and changes of with test time, are discussed relative to the hypothesis that efficiency of the statolith organs decreases with body tilt increase, favouring increase of interference of somatoreceptors and the optical reference.     

Modal operators with probabilistic interpretations,I

We present a class of normal modal calculi P_FD, whose syntax is endowed with operators M _r (and their dual ones, L _r), one for each r [0,1]: if a is sentence, M _r is to he read the probability that a is true is strictly greater than r and to he evaluated as true or false in every world of a F-restricted probabilistic kripkean model. Every such a model is a kripkean model, enriched by a family of regular (see below) probability evaluations with range in a fixed finite subset F of [0,1]: there is one such a function for every world w, P _F(w,-), and this allows to evaluate M ^ra as true in the world w iff p _F(w, ) r.For every fixed F as before, suitable axioms and rules are displayed, so that the resulting system P _FD is complete and compact with respect to the class of all the F-restricted probabilistic kripkean models.     

An extension of the partial credit model with an application to the measurement of change

The partial credit model is considered under the assumption of a certain linear decomposition of the item × category parameters _ih into basic parameters _j. This model is referred to as the linear partial credit model. A conditional maximum likelihood algorithm for estimation of the j is presented, based on (a) recurrences for the combinatorial functions involved, and (b) using a quasi-Newton approach, the so-called Broyden-Fletcher-Goldfarb-Shanno (BFGS) method; (a) guarantees numerically stable results, (b) avoids the direct computation of the Hesse matrix, yet produces a sequence of certain positive definite matricesB _k ,k=1, 2, ..., converging to the asymptotic variance-covariance matrix of the . The practicality of these numerical methods is demonstrated both by means of simulations and of an empirical application to the measurement of treatment effects in patients with psychosomatic disorders.The authors thank one anonymous reviewer for his constructive comments. Moreover, they thankfully acknowledge financial support by the Österreichische Nationalbank (Austrian National Bank) under Grant No. 3720.     

Analysis of the components of disparity in Wilde's dot-row phenomenon

Summary In this study on Wilde's phenomenon (Wilde 1950) the two components of disparity, one of them processing displacement, and the other one apparent rotation, are analysed in terms of dependence on the disparity of the end-lines of the pattern (), and on the percentage of magnification (M) of one of the monocular patterns in relation to the other one. It was found that the component of disparity for displacement ' can be expressed as a linear regression equation '=–a+b.The component of disparity for rotation, expressed as a percentage of magnification effective for rotation (M) can be expressed as M=a–b₁+b₂M.It was concluded that the two components of disparity are processed through independent parallel channels, the processing of the component of disparity for displacement being the faster process, accounting for the larger part of the total disparity.     

Partially-Ordered (Branching) Generalized Quantifiers: A General Definition

Following Henkins discovery of partially-ordered (branching) quantification (POQ) with standard quantifiers in 1959, philosophers of language have attempted to extend his definition to POQ with generalized quantifiers. In this paper I propose a general definition of POQ with 1-place generalized quantifiers of the simplest kind: namely, predicative, or cardinality quantifiers, e.g., most, few, finitely many, exactly , where is any cardinal, etc. The definition is obtained in a series of generalizations, extending the original, Henkin definition first to a general definition of monotone-increasing (M) POQ and then to a general definition of generalized POQ, regardless of monotonicity. The extension is based on (i) Barwises 1979 analysis of the basic case of M POQ and (ii) my 1990 analysis of the basic case of generalized POQ. POQ is a non-compositional 1st-order structure, hence the problem of extending the definition of the basic case to a general definition is not trivial. The paper concludes with a sample of applications to natural and mathematical languages.     

On the base-free measure of change proposed by Tucker,Damarin and Messick

Tucker, Damarin and Messick proposed a base-free measure of change which involves the computation of residual scores that are uncorrelated with true scores on the pretest. The present note discusses this change measure and demonstrates that, because of an incorrect derivation by the authors, properties they attribute to (the coefficient for the regression of true scores from the second testing on true scores from the first testing) are, in fact, properties ofb, the ordinary regression coefficient. A correct derivation of the initial position—change correlation in terms of is obtained, and Tucker et al.'s discussion of the law of initial values is reconsidered.The preparation of this paper was supported by the Learning Research and Development Center supported in part as a research and development center by funds from the National Institute of Education.     

A deontic logic of action

The formal language studied in this paper contains two categories of expressions, terms and formulas. Terms express events, formulas propositions. There are infinitely many atomic terms and complex terms are made up by Boolean operations. Where and are terms the atomic formulas have the form = ( is the same as ), Forb ( is forbidden) and Perm ( is permitted). The formulae are truth functional combinations of these. An algebraic and a model theoretic account of validity are given and an axiomatic system is provided for which they are characteristic.The closure principle, that what is not forbidden is permitted is shown to hold at the level of outcomes but not at the level of events. In the two final sections some other operators are considered and a semantics in terms of action games.     

On Neat Reducts of Algebras of Logic

SC , CA , QA and QEA stand for the classes of Pinter's substitution algebras, Tarski's cylindric algebras, Halmos' quasipolyadic algebras, and quasipolyadic equality algebras of dimension , respectively. Generalizing a result of Németi on cylindric algebras, we show that for K {SC, CA, QA, QEA} and ordinals < , the class Nr K of -dimensional neat reducts of -dimensional K algebras, though closed under taking homomorphic images and products, is not closed under forming subalgebras (i.e. is not a variety) if and only if > 1.From this it easily follows that for 1 < < , the operation of forming -neat reducts of algebras in K does not commute with forming subalgebras, a notion to be made precise.We give a contrasting result concerning Halmos' polyadic algebras (with and without equality). For such algebras, we show that the class of infinite dimensional neat reducts forms a variety.We comment on the status of the property of neat reducts commuting with forming subalgebras for various reducts of polyadic algebras that are also expansions of cylindric-like algebras. We try to draw a borderline between reducts that have this property and reducts that do not.Following research initiated by Pigozzi, we also emphasize the strong tie that links the (apparently non-related) property of neat reducts commuting with forming subalgebras with proving amalgamation results in cylindric-like algebras of relations. We show that, like amalgamation, neat reducts commuting with forming subalgebras is another algebraic expression of definability and, accordingly, is also strongly related to the well-known metalogical properties of Craig, Beth and Robinson in the corresponding logics.     

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.     

A modification of kendall's tau for measuring association in contingency tables

A coefficient of association is described for a contingency table containing data classified into two sets of ordered categories. Within each of the two sets the number of categories or the number of cases in each category need not be the same.=+1 for perfect positive association and has an expectation of 0 for chance association. In many cases also has –1 as a lower limit. The limitations of Kendall's _a and _b and Stuart's _c are discussed, as is the identity of these coefficients to' under certain conditions. Computational procedure for is given.     

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

- Allatum est die 5 Martii 1970     

Supracompact inference operations

When a proposition is cumulatively entailed by a finite setA of premisses, there exists, trivially, a finite subsetB ofA such thatB B entails for all finite subsetsB that are entailed byA. This property is no longer valid whenA is taken to be an arbitrary infinite set, even when the considered inference operation is supposed to be compact. This leads to a refinement of the classical definition of compactness. We call supracompact the inference operations that satisfy the non-finitary analogue of the above property. We show that for any arbitrary cumulative operationC, there exists a supracompact cumulative operationK(C) that is smaller thenC and agrees withC on finite sets. Moreover,K(C) inherits most of the properties thatC may enjoy, like monotonicity, distributivity or disjunctive rationality. The main part of the paper concerns distributive supracompact operations. These operations satisfy a simple functional equation, and there exists a representation theorem that provides a semantic characterization for this family of operations. We examine finally the case of rational operations and show that they can be represented by a specific kind of model particularly easy to handle.