A Sequent Calculus for a Negative Free Logic

This article presents a sequent calculus for a negative free logic with identity, called N. The main theorem (in part 1) is the admissibility of the Cut-rule. The second part of this essay is devoted to proofs of soundness, compactness and completeness of N relative to a standard semantics for negative free logic

Physical (A)Causality: Determinism, Randomness and Uncaused Events

Physical indeterminism; Randomness in physics; Physical random number generators; Physical chaos; Self-reflexive knowledge; Acausality in physics; Irreducible randomnes

Investigation, Development, and Evaluation of Performance Proving for Fault-tolerant Computers

A number of methodologies for verifying systems and computer based tools that assist users in verifying their systems were developed. These tools were applied to verify in part the SIFT ultrareliable aircraft computer. Topics covered included: STP theorem prover; design verification of SIFT; high level language code verification; assembly language level verification; numerical algorithm verification; verification of flight control programs; and verification of hardware logic

Three Dogmas of First-Order Logic and some Evidence-based Consequences for Constructive Mathematics of differentiating between Hilbertian Theism, Brouwerian Atheism and Finitary Agnosticism

We show how removing faith-based beliefs in current philosophies of classical and constructive mathematics admits formal, evidence-based, definitions of constructive mathematics; of a constructively well-defined logic of a formal mathematical language; and of a constructively well-defined model of such a language. We argue that, from an evidence-based perspective, classical approaches which follow Hilbert's formal definitions of quantification can be labelled `theistic'; whilst constructive approaches based on Brouwer's philosophy of Intuitionism can be labelled `atheistic'. We then adopt what may be labelled a finitary, evidence-based, `agnostic' perspective and argue that Brouwerian atheism is merely a restricted perspective within the finitary agnostic perspective, whilst Hilbertian theism contradicts the finitary agnostic perspective. We then consider the argument that Tarski's classic definitions permit an intelligence---whether human or mechanistic---to admit finitary, evidence-based, definitions of the satisfaction and truth of the atomic formulas of the first-order Peano Arithmetic PA over the domain N of the natural numbers in two, hitherto unsuspected and essentially different, ways. We show that the two definitions correspond to two distinctly different---not necessarily evidence-based but complementary---assignments of satisfaction and truth to the compound formulas of PA over N. We further show that the PA axioms are true over N, and that the PA rules of inference preserve truth over N, under both the complementary interpretations; and conclude some unsuspected constructive consequences of such complementarity for the foundations of mathematics, logic, philosophy, and the physical sciences

East-West Paths to Unconventional Computing

Unconventional computing is about breaking boundaries in thinking, acting and computing. Typical topics of this non-typical field include, but are not limited to physics of computation, non-classical logics, new complexity measures, novel hardware, mechanical, chemical and quantum computing. Unconventional computing encourages a new style of thinking while practical applications are obtained from uncovering and exploiting principles and mechanisms of information processing in and functional properties of, physical, chemical and living systems; in particular, efficient algorithms are developed, (almost) optimal architectures are designed and working prototypes of future computing devices are manufactured. This article includes idiosyncratic accounts of ‘unconventional computing’ scientists reflecting on their personal experiences, what attracted them to the field, their inspirations and discoveries.info:eu-repo/semantics/publishedVersio

The Significance of Evidence-based Reasoning for Mathematics, Mathematics Education, Philosophy and the Natural Sciences

In this multi-disciplinary investigation we show how an evidence-based perspective of quantification---in terms of algorithmic verifiability and algorithmic computability---admits evidence-based definitions of well-definedness and effective computability, which yield two unarguably constructive interpretations of the first-order Peano Arithmetic PA---over the structure N of the natural numbers---that are complementary, not contradictory. The first yields the weak, standard, interpretation of PA over N, which is well-defined with respect to assignments of algorithmically verifiable Tarskian truth values to the formulas of PA under the interpretation. The second yields a strong, finitary, interpretation of PA over N, which is well-defined with respect to assignments of algorithmically computable Tarskian truth values to the formulas of PA under the interpretation. We situate our investigation within a broad analysis of quantification vis a vis: * Hilbert's epsilon-calculus * Goedel's omega-consistency * The Law of the Excluded Middle * Hilbert's omega-Rule * An Algorithmic omega-Rule * Gentzen's Rule of Infinite Induction * Rosser's Rule C * Markov's Principle * The Church-Turing Thesis * Aristotle's particularisation * Wittgenstein's perspective of constructive mathematics * An evidence-based perspective of quantification. By showing how these are formally inter-related, we highlight the fragility of both the persisting, theistic, classical/Platonic interpretation of quantification grounded in Hilbert's epsilon-calculus; and the persisting, atheistic, constructive/Intuitionistic interpretation of quantification rooted in Brouwer's belief that the Law of the Excluded Middle is non-finitary. We then consider some consequences for mathematics, mathematics education, philosophy, and the natural sciences, of an agnostic, evidence-based, finitary interpretation of quantification that challenges classical paradigms in all these disciplines

Aspects of the constructive omega rule within automated deduction

In general, cut elimination holds for arithmetical systems with the w -rule, but not for systems with ordinary induction. Hence in the latter, there is the problem of generalisation, since arbitrary formulae can be cut in. This makes automatic theorem -proving very difficult. An important technique for investigating derivability in formal systems of arithmetic has been to embed such systems into semi- formal systems with the w -rule. This thesis describes the implementation of such a system. Moreover, an important application is presented in the form of a new method of generalisation by means of "guiding proofs" in the stronger system, which sometimes succeeds in producing proofs in the original system when other methods fail

What structuralism could not be

Frege's arithmetical-platonism is glossed as the first step in developing the thesis; however, it remains silent on the subject of structures in mathematics: the obvious examples being groups and rings, lattices and topologies. The structuralist objects to this silence, also questioning the sufficiency of Fregean platonism is answering a number of problems: e.g. Benacerraf's Twin Puzzles of Epistemic and Referential Access. The development of structuralism as a philosophical position, based on the slogan 'All mathematics is structural' collapses: there is no single coherent account which remains faithful to the tenets of structuralism and solves the puzzles of platonism. This prompts the adoption of a more modest structuralism, the aim of which is not to solve the problems facing arithmetical-platonism, but merely to give an account of the 'obviously structural areas of mathematics'. Modest strucmralism should complement an account of mathematical systems; here, Frege's platonism fulfils that role, which then constrains and shapes the development of this modest structuralism. Three alternatives are considered; a substitutional account, an account based on a modification of Dummett's theory of thin reference and a modified from of in re structuralism. This split level analysis of mathematics leads to an investigation of the robustness of the truth predicate over the two classes of mathematical statement. Focussing on the framework set out in Wright's Truth and Objectivity, a third type of statement is identified in the literature: Hilbert's formal statements. The following thesis arises: formal statements concern no special subject matter, and are merely minimally truth apt; the statements of structural mathematics form a subdiscourse - identified by the similarity of the logical grammar - displaying cognitive command. Thirdly, the statements of mathematics which concern systems form a subdiscourse which has both cognitive command and width of cosmological role. The extensions of mathematical concepts are such that best practice on the part of mathematicians either tracks or determines that extension - at least in simple cases. Examining the notions of response dependence leads to considerations of indefinite extensibility and intuitionism. The conclusion drawn is that discourse about structures and mathematical systems are response dependent but that this does not give rise to any revisionary arguments contra intuitionism