Bar Induction occupies a central place in Brouwerian mathematics. This note is concerned with the strength of Bar Induction on the basis of Constructive Zermelo-Fraenkel Set Theory, CZF. It is shown that CZF augmented by decidable Bar Induction proves the 1-consistency of CZF. This answers a question of P. Aczel who used Bar Induction to give a proof of the Lusin Separation Theorem in the constructive set theory CZF.

M. Forti and F. Honsell showed in [4] that the hyperuniverses defined in [2] satisfy the anti-foundation axiom X1 introduced in [3]. So it is interesting to study the axiom AFA, which is equivalent to X1 in ZF, introduced by P. Aczel in [1]. We show in this paper that AFA is inconsistent with the theory GPK. This theory, which is first order, is defined by E. Weydert in [6] and later by M. Forti and R. Hinnion in [2]. (...) It includes all general hyperuniverses as defined in [5]. In order to achieve our aim, we need to define ordinals in GPK and to study some of their properties. (shrink)

Some propositions add more information to bodies of propositions than do others. We start with intuitive considerations on qualitative comparisons of information added . Central to these are considerations bearing on conjunctions and on negations. We find that we can discern two distinct, incompatible, notions of information added. From the comparative notions we pass to quantitative measurement of information added. In this we borrow heavily from the literature on quantitative representations of qualitative, comparative conditional probability. We look at two ways (...) to obtain a quantitative conception of information added. One, the most direct, mirrors Bernard Koopman’s construction of conditional probability: by making a strong structural assumption, it leads to a measure that is, transparently, some function of a function P which is, formally, an assignment of conditional probability (in fact, a Popper function). P reverses the information added order and mislocates the natural zero of the scale so some transformation of this scale is needed but the derivation of P falls out so readily that no particular transformation suggests itself. The Cox–Good–Aczél method assumes the existence of a quantitative measure matching the qualitative relation, and builds on the structural constraints to obtain a measure of information that can be rescaled as, formally, an assignment of conditional probability. A classical result of Cantor’s, subsequently strengthened by Debreu, goes some way towards justifying the assumption of the existence of a quantitative scale. What the two approaches give us is a pointer towards a novel interpretation of probability as a rescaling of a measure of information added. (shrink)

This note argues against Barwise and Etchemendy's claim that their semantics for self-reference requires use of Aczel's anti-foundational set theory, AFA, semantics for self-reference requires use of Aczel's anti-foundational set theory, AFA, ones irrelevant to the task at hand" (The Liar, p. 35). Switching from ZF to AFA neither adds nor precludes any isomorphism types of sets. So it makes no difference to ordinary mathematics. I argue against the author's claim that a certain kind of 'naturalness' nevertheless makes (...) AFA preferable to ZF for their purposes. I cast their semantics in a natural, isomorphism invariant form with self-reference as a fixed point property for propositional operators. Independent of the particulars of any set theory, this form is somewhat simpler than theirs and easier to adapt to other theories of self-reference. (shrink)

We interpret intuitionistic theories of (iterated) strictly positive inductive definitions (s.p.-ID i′ s) into Martin-Löf's type theory. The main purpose being to obtain lower bounds of the proof-theoretic strength of type theories furnished with means for transfinite induction (W-type, Aczel's set of iterative sets or recursion on (type) universes). Thes.p.-ID i′ s are essentially the wellknownID i -theories, studied in ordinal analysis of fragments of second order arithmetic, but the set variable in the operator form is restricted to occur (...) only strictly positively. The modelling is done by constructivizing continuity notions for set operators at higher number classes and proving that strictly positive set operators are continuous in this sense. The existence of least fixed points, or more accurately, least sets closed under the operator, then easily follows. (shrink)

A continuoxis t- norm is a continuous map * from [0, 1]² into [0,1] such that is a commutative totally ordered monoid. Since the natural ordering on [0,1] is a complete lattice ordering, each continuous t-norm induces naturally a residuation → and becomes a commutative naturally ordered residuated monoid, also called a hoop. The variety of basic hoops is precisely the variety generated by all algebras, where * is a continuous t-norm. In this paper we investigate the structure of the (...) variety of basic hoops and some of its subvarieties. In particular we provide a complete description of the finite subdirectly irreducible basic hoops, and we show that the variety of basic hoops is generated as a quasivariety by its finite algebras. We extend these results to Hájek's BL-algebras, and we give an alternative proof of the fact that the variety of BL-algebras is generated by all algebras arising from continuous t-norms on [ 0,1] and their residua. The last part of the paper is devoted to the investigation of the subreducts of BL- algebras, of Gödel algebras and of product algebras. (shrink)

A continuoxis t- norm is a continuous map * from [0, 1]² into [0,1] such that ([ 0,1], *, 1) is a commutative totally ordered monoid. Since the natural ordering on [0,1] is a complete lattice ordering, each continuous t-norm induces naturally a residuation → and ([ 0,1], *, →, 1) becomes a commutative naturally ordered residuated monoid, also called a hoop. The variety of basic hoops is precisely the variety generated by all algebras ([ 0,1], *, →, 1), where (...) * is a continuous t-norm. In this paper we investigate the structure of the variety of basic hoops and some of its subvarieties. In particular we provide a complete description of the finite subdirectly irreducible basic hoops, and we show that the variety of basic hoops is generated as a quasivariety by its finite algebras. We extend these results to Hájek's BL-algebras, and we give an alternative proof of the fact that the variety of BL-algebras is generated by all algebras arising from continuous t-norms on [ 0,1] and their residua. The last part of the paper is devoted to the investigation of the subreducts of BL- algebras, of Gödel algebras and of product algebras. (shrink)

We show how in the hierarchies${F_\alpha }$of Fieldian truth sets, and Herzberger’s${H_\alpha }$revision sequence starting from any hypothesis for${F_0}$ that essentially each${H_\alpha }$ carries within it a history of the whole prior revision process.As applications we provide a precise representation for, and a calculation of the length of, possiblepath independent determinateness hierarchiesof Field’s construction with a binary conditional operator. We demonstrate the existence of generalized liar sentences, that can be considered as diagonalizing past the determinateness hierarchies definable in Field’s recent (...) models. The ‘defectiveness’ of such diagonal sentences necessarily cannot be classified by any of the determinateness predicates of the model. They are ‘ineffable liars’. We may consider them a response to the claim of Field that ‘the conditional can be used to show that the theory is not subject to “revenge problems”.’. (shrink)

We represent truth sets for a variety of the well known semantic theories of truth as those sets consisting of all sentences for which a player has a winning strategy in an infinite two person game. The classifications of the games considered here are simple, those over the natural model of arithmetic being all within the arithmetical class of $\Sum_{3}^{0}$.

We develop and apply a multi-dimensional conception of explanatory depth towards a comparative analysis of inflationary and bouncing paradigms in primordial cosmology. Our analysis builds on earlier work due to Azhar and Loeb (2021) that establishes initial condition fine-tuning as a dimension of explanatory depth relevant to debates in contemporary cosmology. We propose dynamical fine-tuning and autonomy as two further dimensions of depth in the context of problems with instability and trans-Planckian modes that afflict bouncing and inflationary approaches respectively. In (...) the context of the latter issue, we argue that the recently formulated trans-Planckian censorship conjecture leads to a trade-off for inflationary models between dynamical fine-tuning and autonomy. We conclude with the suggestion that explanatory preference with regard to the different dimensions of depth is best understood in terms of differing attitudes towards heuristics for future model building. (shrink)

Distributive, procedural, and interactional justice are constructs that are increasingly being recognized as important factors that affect individual perceptions in the workplace environment. This paper presents a theoretical perspective that suggests that justice is perceived through a subjective lens that consists of individualized beliefs and proposes that cultural attributes and demographic characteristics play an integral part in determining the perception of justice. The distinctions between these three constructs are presented in context with the core beliefs of individual employees – affected (...) by a multitude of perceptual and demographic factors that we briefly identify herein. Based on the theoretical perspective, an instrument that measures the constructs of justice as perceived by individuals was developed. With a focus on justice within the business setting, hypotheses about attitudes related to justice were tested. Survey results confirm that the three constructs of justice are distinct but correlated. Significant differences were found in the perceptions of African-American respondents with regard to procedural justice. Although the empirical findings do not support all the hypotheses, this research highlights the need for further development of measures to assess the perception of justice in business settings and at an applied level, underscores the importance of recognizing cultural attributes and demographic characteristics in understanding how justice is perceived. (shrink)

When I offered this title, I was engaging myself to investigate an apparent difference between two kinds of intentionality, in the hope that I should be able to find some firm logical criterion to distinguish them. I was less successful in this than I had hoped. I think I have gained a certain amount of insight into the logic and semantics of one kind of intentional context, largely due to the work I was doing while visiting the University of Pennsylvania (...) on Frege and on Michael Dummett’s monumental commentary on Frege. But as regards the other variety of intentionality I am still very much in the dark; so I am giving you thus far merely a progress report on that. (shrink)

We analyse the extent of possible computations following Hogarth ([2004]) conducted in Malament–Hogarth (MH) spacetimes, and Etesi and Németi ([2002]) in the special subclass containing rotating Kerr black holes. Hogarth ([1994]) had shown that any arithmetic statement could be resolved in a suitable MH spacetime. Etesi and Németi ([2002]) had shown that some relations on natural numbers that are neither universal nor co-universal, can be decided in Kerr spacetimes, and had asked specifically as to the extent of computational limits there. (...) The purpose of this note is to address this question, and further show that MH spacetimes can compute far beyond the arithmetic: effectively Borel statements (so hyperarithmetic in second-order number theory, or the structure of analysis) can likewise be resolved: Theorem A. If H is any hyperarithmetic predicate on integers, then there is an MH spacetime in which any query ? n H ? can be computed. In one sense this is best possible, as there is an upper bound to computational ability in any spacetime, which is thus a universal constant of that spacetime. Theorem C. Assuming the (modest and standard) requirement that spacetime manifolds be paracompact and Hausdorff, for any spacetime there will be a countable ordinal upper bound, , on the complexity of questions in the Borel hierarchy computable in it. Introduction 1.1 History and preliminaries Hyperarithmetic Computations in MH Spacetimes 2.1 Generalising SADn regions 2.2 The complexity of questions decidable in Kerr spacetimes An Upper Bound on Computational Complexity for Each Spacetime CiteULike Connotea Del.icio.us What's this? (shrink)

We show that Leitgeb’s dependence operator of Leitgeb is a \-operator and that this is best possible.

P S Wilson; Child-Centred Education, Journal of Philosophy of Education, Volume 3, Issue 1, 30 May 2006, Pages 105–126, https://doi.org/10.1111/j.1467-9752.1969.

In this essay, P. Taylor Webb and Kalervo N. Gulson argue that educational policy is a spatial process and that implementation processes in particular produce crucial emergent geographies for policy research. Webb and Gulson describe how emergent geographies are produced when policy folds actors through senses and enactments of policy. The idea that policy is sensed and enacted is developed into the concept of a policy intension that extends approaches to spatial and, in particular, micropolitical analyses in policy research. Webb (...) and Gulson conclude by discussing cartographical methods that better map the geographies of subjectivity produced through policy intensions. (shrink)

We consider notions of truth and logical validity defined in various recent constructions of Hartry Field. We try to explicate his notion of determinate truth by clarifying the path-dependent hierarchies of his determinateness operator.

P S Wilson; Perspectives on Punishment—Reply to Pamela Moore, Journal of Philosophy of Education, Volume 8, Issue 1, 30 May 2006, Pages 103–134, https://doi.org.

Tradução para o português do livro "Ceticismo e naturalismo: algumas variedades", Strawson, P. F. . São Leopoldo, RS: Editora da Unisinos, 2008, 114 p. Coleção: Ideias. ISBN: 9788574313214. Capítulo 1 - Ceticismo, naturalismo e argumentos transcendentais 1. Notas introdutórias; 2. Ceticismo tradicional; 3. Hume: Razão e Natureza; 4. Hume e Wittgenstein; 5. “Apenas relacionar”: O papel dos argumentos transcendentais; 6. Três citações; 7. Historicismo: e o passado.