Varieties of Monadic Heyting Algebras. Part III

This paper is the concluding part of [1] and [2], and it investigates the inner structure of the lattice (MHA) of all varieties of monadic Heyting algebras. For every n , we introduce and investigate varieties of depth n and cluster n, and present two partitions of (MHA), into varieties of depth n, and into varieties of cluster n. We pay a special attention to the lower part of (MHA) and investigate finite and critical varieties of monadic Heyting algebras in detail. In particular, we prove that there exist exactly thirteen critical varieties in (MHA) and that it is decidable whether a given variety of monadic Heyting algebras is finite or not. The representation of (MHA) is also given. All these provide us with a satisfactory insight into (MHA). Since (MHA) is dual to the lattice NExtMIPC of all normal extensions of the intuitionistic modal logic MIPC, we also obtain a clearer picture of the lattice structure of intuitionistic modal logics over MIPC.     

On Extensions of Intermediate Logics by Strong Negation

In this paper we will study the properties of the least extension n() of a given intermediate logic by a strong negation. It is shown that the mapping from to n() is a homomorphism of complete lattices, preserving and reflecting finite model property, frame-completeness, interpolation and decidability. A general characterization of those constructive logics is given which are of the form n (). This summarizes results that can be found already in [13,14] and [4]. Furthermore, we determine the structure of the lattice of extensions of n(LC).     

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.     

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

- Allatum est die 5 Martii 1970     

Third Men: The Logic of the Sophisms at Arist. SE 22, 178b36–170a10

This article aims at elucidating the logic of Arist. SE 22, 178b36–179a10 and, in particular, of the sophism labelled "Third Man" discussed in it. I suggest that neither the sophistic Walking Man argument, proposed by ancient commentators, nor the Aristotelian Third Man of the , suggested by modern interpreters, can be identified with the fallacious argument Aristotle presents and solves in the passage. I propose an alternative reconstruction of the Third Man sophism and argue that an explanation of the lines regarding the identity of Coriscus and Coriscus the musician (178b39–179a3) is indispensable for its correct understanding, since they hint at another sophism in some important aspects analogous. Finally, I show that two contradictions concerning spotted by scholars in the passage are only apparent and can be dissolved once the assumption that the anti-Platonic Third Man argument is at stake here is discarded, and once the passage is read in the light of its agonistic context.     

Mathematical quantum theory I: Random ultrafilters as hidden variables

The basic purpose of this essay, the first of an intended pair, is to interpret standard von Neumann quantum theory in a framework of iterated measure algebraic truth for mathematical (and thus mathematical-physical) assertions — a framework, that is, in which the truth-values for such assertions are elements of iterated boolean measure-algebras (cf. Sections 2.2.9, 5.2.1–5.2.6 and 5.3 below).The essay itself employs constructions of Takeuti's boolean-valued analysis (whose origins lay in work of Scott, Solovay, Krauss and others) to provide a metamathematical interpretation of ideas sometimes considered disparate, heuristic, or simply ill-defined: the collapse of the wave function, for example; Everett's many worlds'-construal of quantum measurement; and a natural product space of contextual (nonlocal) hidden variables.More precisely, these constructions permit us to write down a category-theoretically natural correlation between ideal outcomes of quantum measurements u of a universal wave function, and possible worlds of an Everett-Wheeler-like many-worlds-theory.The universal wave function, first, is simply a pure state of the Hilbert space (L ₂([0, 1]) ^M in a model M an appropriate mathematical-physical theory T, where T includes enough set-theory to derive all the analysis needed for von Neumann-algebraic formulations of quantum theory.The worlds of this framework can then be given a genuine model-theoretic construal: they are random models M(u) determined by M-random elements u of the unit interval [0, 1], where M is again a fixed model of T.Each choice of a fixed basis for a Hilbert space H in a model of M of T then assigns ideal spectral values for observables A on H (random ultrafilters on the range of A regarded as a projection-valued measure) to such M-random reals u. If is the universal Lebesgue measure-algebra on [0, 1], these assignments are interrelated by the spectral functional calculus with value 1 in the boolean extension (V( )) ^M , and therefore in each M(u).Finally, each such M-random u also generates a corresponding extension M(u) of M, in which ideal outcomes of measurements of all observables A in states are determined by the assignments just mentioned from the random spectral values u for the universal position-observable on L ₂([0, 1]) in M.At the suggestion of the essay's referee, I plan to draw on its ideas in the projected sequel to examine more recent modal and decoherence-interpretations of quantum theory, as well as Schrödinger's traditional construal of time-evolution. A preliminary account of the latter — an obvious prerequisite for any serious many-worlds-theory, given that Everett's original intention was to integrate time-evolution and wave-function collapse — is sketched briefly in Section 5.3. The basic idea is to apply results from the theory of iterated measure-algebras to reinterpret time-ordered processes of measurements (determined, for example, by a given Hamiltonian observable H in M) as individual measurements in somewhat more complexly defined extensions M(u) of M.In plainer English: if one takes a little care to distinguish boolean- from measure-algebraic tensor-products of the universal measure-algebra L, one can reinterpret formal time-evolution so that it becomes internal to the universal random models M(u).     

Can Parts of Space Move? On Paragraph Six of Newton’s Scholium

Paragraph 6 of Newtons Scholium argues that the parts of space cannot move. A premise of the argument – that parts have individuality only through an order of position – has drawn distinguished modern support yet little agreement among interpretations of the paragraph. I argue that the paragraph offers an a priori, metaphysical argument for absolute motion, an argument which is invalid. That order of position is powerless to distinguish one part of Euclidean space from any other has gone virtually unremarked. It remains uncertain what the import of the paragraph is but it is not close to apparently similar arguments of Leibniz.     

Beyond verisimilitude: A linguistically invariant basis for scientific progress

This paper proposes a solution to David Miller's Minnesotan-Arizonan demonstration of the language dependence of truthlikeness (Miller 1974), along with Miller's first-order demonstration of the same (Miller 1978). It is assumed, with Peter Urbach, that the implication of these demonstrations is that the very notion of truthlikeness is intrinsically language dependent and thus non-objective. As such, truthlikeness cannot supply a basis for an objective account of scientific progress. I argue that, while Miller is correct in arguing that the number of true atomic sentences of a false theory is language dependent, the number of known sentences (under certain straightforward assumptions) is conserved by translation; degree of knowledge, unlike truthlikeness, is thus a linguistically invariant notion. It is concluded that the objectivity of scientific progress must be grounded on the fact (noted in Cohen 1980) that knowledge, not mere truth, is the aim of science.For criticism and comments I am indebted to Noretta Koertge, David Miller, and an anonymous Synthese referee.     

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.     

Sheaves over Heyting lattices

For a complete Heyting lattice , we define a category Etale (). We show that the category Etale () is equivalent to the category of the sheaves over , Sh(), hence also with -valued sets, see [2], [1]. The category Etale() is a generalization of the category Etale (X), see [1], where X is a topological space.     

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.     

Socialism in One Country: A Reassessment

Until 1917 Lenin and Trotsky believed that an isolated revolutionary Russia would have no chance of survival. However, from 1917 to 1923 Lenin's standpoint on this matter underwent a complete reversal. First he came to the conclusion that socialism could be built in an isolated Russia, although it would remain incomplete in the absence of the world revolution. By 1923 he was abandoning that latter qualification too. The standpoint of Stalin and Bukharin in the debate on socialism in one country of 1925–26 was more orthodox-Leninist than the position taken by Trotsky, who had at first also embraced the notion of incomplete socialism, but subsequently returned to the old concept, abandoned by Lenin, that the restoration of capitalism was inevitable in the absence of the world revolution.     

Some notes on the nature of methodological indeterminacy

This paper is an attempt to extend the meaning of the concept of indeterminacy for the human sciences. The authors do this by coining the term methodological indeterminacy and arguing that indeterminacy is better understood when linked to specific methodological techniques. Paradoxically, while specific research techniques demonstrate that the issue of indeterminacy is complex, yielding the possibility of types and degrees, it does not eliminate the problem of translation first raised by Quine. However, the authors go on to argue that, from a research perspective, indeterminacy can and must be approached in such a way that it is possible to reduce cases of it, even though never completely eliminating it in the human sciences.     

Stuffed Cabbage in the Old New School Cafeteria

The purpose of this lecture is to celebrate the memory of Aron Gurwitsch by examining and enlarging the domain of phenomenological clarification of some elements of what Gurwitsch called the logic of reality. Chief among those elements are the nature of the taken-for-grantedness of our existential belief, the difference between presentive and non-presentive indices of reality and the ground for the self-illumination of the world of working.     

Die Entwicklung der Diskussion um die formale Logik in der Sowjetunion

Ohne ZusammenfassungDie Literatur zur Logik in der Sowjetunion ist sehr bescheiden. Nebst einigen Kapiteln in grösseren Werken sind es folgende Schriften: Bochénski, I. M., Soviet Logic,SST, 1, 29–38. — Dahm, H., Renaissance der formalen Logik,Ost-Probleme, 1957,8, 254–267. — Philipov, A.,Logic and Dialectic in the Soviet Union, New York 1952, XI+89 pp. — Winkelmann, A., Die Stellung der formalen Logik im Sowjet-system,Scholastik, 1956,1, 85–89.     

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.     

Proof-Theoretic Modal PA-Completeness I: A System-Sequent Metric

This paper is the first of a series of three articles that present the syntactic proof of the PA-completeness of the modal system G, by introducing suitable proof-theoretic objects, which also have an independent interest. We start from the syntactic PA-completeness of modal system GL-LIN, previously obtained in [7], [8], and so we assume to be working on modal sequents S which are GL-LIN-theorems. If S is not a G-theorem we define here a notion of syntactic metric d(S, G): we calculate a canonical characteristic fomula H of S (char(S)) so that _G H (S) and _GL-LIN H, and the complexity of H gives the distance d(S, G) of S from G. Then, in order to produce the whole completeness proof as an induction on this d(S, G), we introduce the tree-interpretation of a modal sequent Q into PA, that sends the letters of Q into PA-formulas describing the properties of a GL-LIN-proof P of Q: It is also a d(*, G)-metric linked interpretation, since it will be applied to a proof-tree T of H with H = char(S) and ( H) = d(S, G).     

Suffering without subjectivity

This paper argues that it is possible for suffering to occur in the absence of phenomenal consciousness – in the absence of a certain sort of experiential subjectivity, that is. (Phenomenal consciousness is the property that some mental states possess, when it is like something to undergo them, or when they have subjective feels, or possess qualia.) So even if theories of phenomenal consciousness that would withhold such consciousness from most species of non-human animal are correct, this neednt mean that those animals dont suffer, and arent appropriate objects of sympathy and concern.     

The relevance of Habermas' communicative turn

This paper points out the way in which educational and communicative action (Habermas) are to be related. It is shown that earlier attempts to put Habermas ideas to use have led to a dead end because they do not realize clearly that the new basic notion introduced by Habermas, namely communicative action, is the expression of a communicative turn. It is argued that Habermas' concept expresses a radical new attempt to grasp the intersubjective character of social action. Next implications of this communicative turn for the concept of education as a social praxis are indicated. Education can be conceived of as a praxis responding to the vulnerability of a communicative self.     

Cooperation,Knowledge, and Time: Alternating-time Temporal Epistemic Logic and its Applications

Branching-time temporal logics have proved to be an extraordinarily successful tool in the formal specification and verification of distributed systems. Much of their success stems from the tractability of the model checking problem for the branching time logic CTL, which has made it possible to implement tools that allow designers to automatically verify that systems satisfy requirements expressed in CTL. Recently, CTL was generalised by Alur, Henzinger, and Kupferman in a logic known as Alternating-time Temporal Logic (ATL). The key insight in ATL is that the path quantifiers of CTL could be replaced by cooperation modalities, of the form , where is a set of agents. The intended interpretation of an ATL formula is that the agents can cooperate to ensure that holds (equivalently, that have a winning strategy for ). In this paper, we extend ATL with knowledge modalities, of the kind made popular in the work of Fagin, Halpern, Moses, Vardi and colleagues. Combining these knowledge modalities with ATL, it becomes possible to express such properties as group can cooperate to bring about iff it is common knowledge in that . The resulting logic — Alternating-time Temporal Epistemic Logic (ATEL) — shares the tractability of model checking with its ATL parent, and is a succinct and expressive language for reasoning about game-like multiagent systems.