The problem of artificial precision in theories of vagueness: a note on the role of maximal consistency

The problem of artificial precision is a major objection to any theory of vagueness based on real numbers as degrees of truth. Suppose you are willing to admit that, under sufficiently specified circumstances, a predication of "is red" receives a unique, exact number from the real unit interval [0,1]. You should then be committed to explain what is it that determines that value, settling for instance that my coat is red to degree 0.322 rather than 0.321. In this note I revisit the problem in the important case of {\L}ukasiewicz infinite-valued propositional logic that brings to the foreground the role of maximally consistent theories. I argue that the problem of artificial precision, as commonly conceived of in the literature, actually conflates two distinct problems of a very different nature.Comment: 11 pages, 2 table

Ancient Logic and its Modern Interpretations: Proceedings of the Buffalo Symposium on Modernist Interpretations of Ancient Logic, 21 and 22 April, 1972

Articles by Ian Mueller, Ronald Zirin, Norman Kretzmann, John Corcoran, John Mulhern, Mary Mulhern,Josiah Gould, and others. Topics: Aristotle's Syllogistic, Stoic Logic, Modern Research in Ancient Logic

Notes on the Mathematical Foundations of Analogue Computation

Digital computing has its mathematical foundations in (classical) recursion theory and constructive mathematics. The implicit, working, assumption of those who practice the noble art of analog computing may well be that the mathematical foundations of their subject is as sound as the foundations of the real analysis. That, in turn, implies a reliance on the soundness of set theory plus the axiom of choice. This is, surely, seriously disturbing from a computation point of view. Therefore, in this paper, I seek to locate a foundation for analog computing in exhibiting some tentative dualities with results that are analogous to those that are standard in computability theory. The main question, from the point of view of economics, is whether the Phillips Machine, as an analog computer, has universal computing properties. The conjectured answer is in the negative.

Remarks on the order-theoretical and algebraic properties of quantum structures

This thesis is concerned with the analysis of common features and distinguishing traits of algebraic structures arising in the sharp as well as in the unsharp approaches to quan- tum theory both from an order-theoretical and an algebraic perspective. Firstly, we recall basic notions of order theory and universal algebra. Furthermore, we introduce fundamental concepts and facts concerning the algebraic structures we deal with, from orthomodular lattices to e↵ect algebras, MV algebras and their non-commutative gener- alizations. Finally, we present Basic algebras as a general framework in which (lattice) quantum structures can be studied from an universal algebraic perspective. Taking advantage of the categorical (term-)equivalence between Basic algebras and Lukasiewicz near semirings, in Chapter 3 we provide a structure theory for the lat- ter in order to highlight that, if turned into near-semirings, orthomodular lattices, MV algebras and Basic algebras determine ideals amenable of a common simple description. As a consequence, we provide a rather general Cantor-Bernstein Theorem for involutive left-residuable near semirings. In Chapter 4, we show that lattice pseudoe↵ect algebras, i.e. non-commutative gener- alizations of lattice e↵ect algebras can be represented as near semirings. One one side, this result allows the arithmetical treatment of pseudoe↵ect algebras as total structures; on the other, it shows that near semirings framework can be really seen as the common “ground” on which (commutative and non commutative) quantum structures can be studied and compared. In Chapter 5 we show that modular paraorthomodular lattices can be represented as semiring-like structures by first converting them into (left-) residuated structures. To this aim, we show that any modular bonded lattice A with antitone involution satisfying a strengthened form of regularity can be turned into a left-residuated groupoid. This condition turns out to be a sucient and necessary for a Kleene lattice to be equipped with a Boolean-like material implication. Finally, in order to highlight order theoretical peculiarities of orthomodular quantum structures, in Chapter 6 we weaken the notion of orthomodularity for posets by introduc- ing the concept of the generalized orthomodularity property (GO-property) expressed in terms of LU-operators. This seemingly mild generalization of orthomodular posets and its order theoretical analysis yields rather strong applications to e↵ect algebras, and orthomodular structures. Also, for several classes of orthoalgebras, the GO-property yields a completely order-theoretical characterization of the coherence law and, in turn, of proper orthoalgebras

The Phillips Machine, The Analogue Computing Traditoin in Economics and Computability

In this paper I try to argue for the desirability of analog computation in economics from a variety of perspectives, using the example of the Phillips Machine. Ultimately, a case is made for the underpinning of both analog and digital computing theory in constructive mathematics. Some conceptual confusion in the meaning of analog computing and its non-reliance on the theory of numerical analysis is also discussed. Digital computing has its mathematical foundations in (classical) recursion theory and constructive mathematics. The implicit, working, assumption of those who practice the noble art of analog computing may well be that the mathematical foundations of their subject is as sound as the foundations of the real analysis. That, in turn, implies a reliance on the soundness of set theory plus the axiom of choice. This is, surely, seriously disturbing from a computation point of view. Therefore, in this paper, I seek to locate a foundation for analog computing in exhibiting some tentative dualities with results that are analogous to those that are standard in computability theory. The main question, from the point of view of economics, is whether the Phillips Machine, as an analog computer, has universal computing properties. The conjectured answer is in the negative.Phillips Machine, Analogue Computation, Digital Computation, Computability, General Purpose Analogue Computer

Boundary Algebra: A Simpler Approach to Boolean Algebra and the Sentential Connectives

Boundary algebra [BA] is a algebra of type , and a simplified notation for Spencer-Brown’s (1969) primary algebra. The syntax of the primary arithmetic [PA] consists of two atoms, () and the blank page, concatenation, and enclosure between ‘(‘ and ‘)’, denoting the primitive notion of distinction. Inserting letters denoting, indifferently, the presence or absence of () into a PA formula yields a BA formula. The BA axioms are A1: ()()= (), and A2: “(()) [abbreviated ‘⊥’] may be written or erased at will,” implying (⊥)=(). The repeated application of A1 and A2 simplifies any PA formula to either () or ⊥. The basis for BA is B1: abc=bca (concatenation commutes & associates); B2, ⊥a=a (BA has a lower bound, ⊥); B3, (a)a=() (BA is a complemented lattice); and B4, (ba)a=(b)a (implies that BA is a distributive lattice). BA has two intended models: (1) the Boolean algebra 2 with base set B={(),⊥}, such that () ⇔ 1 [dually 0], (a) ⇔ a′, and ab ⇔ a∪b [a∩b]; and (2) sentential logic, such that () ⇔ true [false], (a) ⇔ ~a, and ab ⇔ a∨b [a∧b]. BA is a self-dual notation, facilitates a calculational style of proof, and simplifies clausal reasoning and Quine’s truth value analysis. BA resembles C.S. Peirce’s graphical logic, the symbolic logics of Leibniz and W.E. Johnson, the 2 notation of Byrne (1946), and the Boolean term schemata of Quine (1982).Boundary algebra; boundary logic; primary algebra; primary arithmetic; Boolean algebra; calculation proof; G. Spencer-Brown; C.S. Peirce; existential graphs