In the early nineteenth century, a series of articles by Laplace and Poisson discussed the importance of ‘directness’ in mathematical methodology. In this thesis, we argue that their conception of a ‘direct’ proof is similar to the more widely contemplated notion of a ‘pure’ proof. More rigorous definitions of mathematical purity were proposed in recent publications by Arana and Detlefsen, as well as by Kahle and Pulcini: we compare Laplace and Poisson’s writings with these modern definitions of purity (...) and show how the modern definitions fail to grasp some more nuanced aspects. (shrink)

During the second half of the 20th century, attempts were made to operationally redefine various social activities, including those related to science, the military, administration and industry. These attempts were aided by scientific and technical innovations developed in the Second World War, and subsequently by the increase in use of automation in various domains. This Ph.D. thesis addresses these attempts from a sociohistorical perspective, focusing on the specific case of archaeology. During this period, the domain of archaeology underwent a process (...) of disciplinarisation and professionalisation. The same occurred in applied mathematics and then computer science: this thesis focuses on the relationships between these three domains. In France, during the 1950's and 1960's, there were significant methodological and conceptual innovations. Their subsequent scientific recognition, was, however, relatively minor. In archaeology, innovations related to applied mathematics and automatics did not lead to the emergence of an archaeological speciality based on computation. This situation was in striking contrast to what happened in other scientific domains and in archaeology in other countries, where new theoretical and methodological Anglophone definitions in ‘New Archaeology’ were spreading worldwide. This thesis explores three collective attempts to redefine the conceptual and methodological basis of archaeology, led by Georges Laplace, Jean-Claude Gardin and Jean Lesage, across France, Spain and Italy. These cases are completed by other people who had significant careers in both engineering and archaeology. In general, this thesis studies a scientific activity by investigating the cognitive and social aspects of peoples’ methodological contributions. Three models of the relationships between experts in a scientific domain and experts in an applied science (here mathematics and computing) are empirically identified and described. The effects of introducing mathematical and automation procedures on the division of labour and the distribution of recognition are analysed. The success or failure of the methodological propositions are discussed with reference to several factors and models of scientific innovation. This thesis generates new information on the development of rescue and preventive archaeology and on the use of digital technologies in human sciences. The analysis draws on 82 interviews, 23 archives and several bibliometric datasets (extracted from pre-existing databases or constructed for the purpose of this research). Mirroring the archaeological propositions under study, this research also intends to illustrate the possible use of computing and formalised procedures in social sciences. The documentation and demonstrative principles underlying this work, implemented by using Wiki, the methods of literate programming and reproducible research, are themselves analysed. (shrink)

In this article, we solve nonlinear systems of third order KdV Equations and the systems of coupled Burgers equations in one and two dimensions with the help of two different methods. The suggested techniques in addition with Laplace transform and Atangana–Baleanu fractional derivative operator are implemented to solve four systems. The obtained results by implementing the proposed methods are compared with exact solution. The convergence of the method is successfully presented and mathematically proved. The results we get are (...) compared with exact solution through graphs and tables which confirms the effectiveness of the suggested techniques. In addition, the results obtained by employing the proposed approaches at different fractional orders are compared, confirming that as the value goes from fractional order to integer order, the result gets closer to the exact solution. Moreover, suggested techniques are interesting, easy, and highly accurate which confirm that these methods are suitable methods for solving any partial differential equations or systems of partial differential equations as well. (shrink)

This groundbreaking work on logic by the brilliant 19th-century English mathematician George Boole remains influential to this day. Boole's major contribution was to demonstrate conclusively that the symbolic expressions of algebra could be adapted to convey the fundamental principles and operations of logic, which hitherto had been expressed only in words. Boole was thus the founder of today's science of symbolic logic. Summing up his innovative approach, Boole stated, "We ought no longer to associate Logic and Metaphysics, but Logic and (...) Mathematics." As the great English logician Augustus De Morgan later put it, in praise of Boole, his genius consisted in showing that "the symbolic processes of algebra, invented as tools of numerical calculation, should be competent to express every act of thought, and to furnish the grammar and dictionary of an all-containing system of logic." The Laws of Thought lays out this new system in detail and also explores a "calculus of probability." The story of Boole's life is as impressive as his work. Besides rudimentary lessons from his father and a few years at local schools, Boole was largely self-taught. Revealing his aptitude for many subjects at an early age, he began his career already at age 16 as a teacher at a village school. In his leisure time he tackled the daunting works of Newton, Laplace, and Lagrange on physics and mathematics. By the age of twenty-four he was submitting original papers to the Cambridge Mathematical Journal and at age twenty-nine he won a medal from the Royal Society for his contributions to mathematical analysis. He continued to so impress his contemporaries that five years later he was appointed professor of mathematics at Queens College, Cork in Ireland, even though he had no university degree. At his untimely death of forty-nine, Boole could never have guessed that his new symbolic logic would become essential in the next century for telephone switching and the design of computers. For this practical reason, as well as the sheer intellectual importance of his accomplishment, The Laws of Thought merits our attention today. (shrink)

It is suggested that the world is locally projectively flat rather than Euclidean. From this postulate it is shown that an (N+1)-particle system has the global geometry of the symmetric spaceSO(4,N+1)/SO(4)×SO(N+1). A complex representation also exists, with structureSU(2,N+1)/S[U(2)×U(N+1)]. Several aspects of these geometrics are developed. Physical states are taken to be eigenfunctions of the Laplace-Beltrami operators. The theory may provide a rational basis for comprehending the groupsSO(4, 2),SU(2)×U(1),SU(3), etc., of current interest.

Being formalized inside the S-matrix scheme, the zigzagging causility model of EPR correlations has full Lorentz and CPT invariance. EPR correlations, proper or reversed, and Wheeler's smoky dragon metaphor are respectively pictured in spacetime or in the momentum-energy space, as V-shaped, A-shaped, or C-shaped ABC zigzags, with a summation at B over virtual states |B〉 〈B|. An exact “correspondence” exists between the Born-Jordan-Dirac “wavelike” algebra of transition amplitudes and the 1774 Laplace algebra of conditional probabilities, where the intermediate summations (...) |B) (B| were over “real hidden states.” While the latter used conditional (or transition) probabilities (A|C) = (C|A), the former uses transition (or conditional) amplitudes 〈A|C〉 = 〈C|A〉*. The formal parrallelism breaks down at the level of interpretation because (A|C) = |〈A|C〉|2. CPT invariance implies the Fock and Watanabe principle that, in quantum mechanics, retarded (advanced) waves are used for prediction (retrodiction), an expression of which is 〈Ψ| U |Φ〉 = 〈Ψ| UΦ〉 = 〈ΦU|Φ〉, with |Φ〉 denoting a preparation, |Ψ〉 a measurement, and U the evolution operator. The transformation |Ψ〉 = |UΦ〉 or |Φ〉 = |U−1Ψ〉 exchanges the “preparation representation” and the “measurement representation” of a system and is ancillary in the formalization of the quantum chance game by the “wavelike algebra” of conditional amplitude. In 1935 EPR overlooked that a conditional amplitude 〈A|C〉 = Σ 〈A|B〉〈B|C〉 between the two distant measurements is at stake, and that only measurements actually performed do make sense. The reversibility 〈A|C〉 = 〈C|A〉* implies that causality is CPT-invariant, or arrowless, at the microlevel. Arrowed causality is a macroscopic emergence, corollary to wave retardation and probability increase. Factlike irreversibility states repression, not suppression, of “blind statistical retrodiction”—that is, of “final cause.”. (shrink)

Imagine you live in 1823 and you are about to design an advanced course on the theory of heat. About fifty years ago, Lavoisier and Laplace had posited caloric as a material substance—an indestructible fluid of fine particles—which was taken to be the cause of heat and in particular, the cause of the rise of temperature of a body, by being absorbed by the body. No doubt, you rely on the best available theory, which is the caloric theory. In (...) particular, meticulous and knowledgeable as you are, you rely on the best of the best: Laplace’s advanced account of the caloric theory of heat, with all its sophistication, detail and predictive might. You really believe that the best science teaching should be based on the best theories that are available. But you also believe that the best theory that is available is not really the best unless it has a claim to truth (or truthlikeness, or partial truth and the like). For what is the point of teaching a theory about the deep structure of the world unless it does say something or other about this deep structure? The course goes really well. Your notes are impressive. They are soon turned into a textbook with lots of explanatory detail and fancy calculations. Alas! The world does not co-operate. There are no calorific particles among the things there are in it. Heat is destroyed when work is produced. The advanced theory is challenged by alternative theories, anomalies and failed predictions. There is agony, but in your lifetime, the caloric theory gets superseded and is left discredited in the wasteland of false theories. Decades come by. You are not around anymore. Your grandchildren go to school and.. (shrink)

The virtue named σϖφροσύνη, which designates « self-restraint », « temperance », « prudence », « circumspection », sometimes condensed in the term « wisdom », is first a moral virtue. In other respects, this word signifies « right senses » in contrast with « frenzy » (either god-inspired or as a part of illness). But the notion of σϖφροσύνη has also a meaning in literary criticism. And in this very context, it presents several employments. One of these is stylistic. (...) Another regards narrative structure and content : this is the subject of the present study. After I have referred to the use of this narrative concept in Plato, I shall demonstrate that its interpretation by Aelius Aristides allows, with that of Maximus of Tyre, to understand Longus’ prayer at the end of the prologue to the Pastorales. This interpretation sheds light specially on the process of a significant episode in the plot of this novel. (shrink)

It is a widely held view in philosophy that propositions perform a plethora of different theoretical roles. Amongst other things, they are believed to be the semantic values of sentences in contexts, the objects of attitudes, the contents of illocutionary acts, and the referents of that-clauses. This assumption is often combined with the claim that propositions have their truth-values eternally. In this paper I aim to show that these two assumptions are incompatible: propositions cannot both fulfill the mentioned roles and (...) be eternally true or false. Following Kaplan and Lewis’s Operator Argument, I argue that compositional semantic values of sentences in contexts do not correspond to eternal propositions. Thus, either we regard the non-eternal entities that in fact realize the semantic role of propositions as also fulfilling the remaining propositional roles, or we abandon the assumption that there is a unique realizer of all the roles. The Operator Argument has recently come under attack, mainly for its tense-logical assumptions. However, rejecting these assumptions is not a sufficient defense of the compatibility of the two claims, since the extensional alternative to the tense-logical framework does not allow us to universally retain eternal propositions as compositional semantic values of sentences either. (shrink)

To improve the safety and the performance of operators involved in risky and demanding missions, human-machine cooperation should be dynamically adapted, in terms of dialogue or function allocation. To support this reconfigurable cooperation, a crucial point is to assess online the operator’s ability to keep performing the mission. The article explores the concept of Operator Functional State, then it proposes to operationalize this concept on the specific activity of drone swarm monitoring, carried out by 22 participants on simulator (...) SUSIE. With the aid of supervised learning methods, physiological and contextual are classified into three classes, corresponding to different levels of OFS. This classification would help for adapting the countermeasures to the situation faced by operators. (shrink)

Emerging technologies such as cloud computing, augmented and virtual reality, artificial intelligence and robotics, among others, are transforming the field of manufacturing and industry as a whole in unprecedent ways. This fourth industrial revolution is consequentially changing how operators that have been crucial to industry success go about their practices in industrial environments. This short paper briefly introduces the notion of the Operator 4.0 as well as how this novel way of conceptualizing the human operator necessarily implicates human (...) values in the technologies that constitute it. Similarly, the design methodology known as value sensitive design (VSD) is drawn upon to discuss how these Operator 4.0 technologies can be design for human values and, conversely, how a potential value-sensitive Operator 4.0 can be used to strengthen the VSD methodology in developing novel technologies. (shrink)

This book studies the foundations of quantum theory through its relationship to classical physics. This idea goes back to the Copenhagen Interpretation (in the original version due to Bohr and Heisenberg), which the author relates to the mathematical formalism of operator algebras originally created by von Neumann. The book therefore includes comprehensive appendices on functional analysis and C*-algebras, as well as a briefer one on logic, category theory, and topos theory. Matters of foundational as well as mathematical interest that (...) are covered in detail include symmetry (and its "spontaneous" breaking), the measurement problem, the Kochen-Specker, Free Will, and Bell Theorems, the Kadison-Singer conjecture, quantization, indistinguishable particles, the quantum theory of large systems, and quantum logic, the latter in connection with the topos approach to quantum theory. This book is Open Access under a CC BY licence. (shrink)

This article explores a phenomenon found in Berber whereby the extraction of dative arguments (of verbs, nouns and prepositions) gives rise to two occurrences of wh. One is a wh-word located in Spec,C and the other a wh-clitic in the dative form located in C (wh-clitic-doubling). Close examination reveals that the wh-word in Spec,C functions as an operator base-generated in its scope position and the dative wh-clitic in C provides it with a derivational link to the variable in the (...) dative position it binds (wh-Cliticisation). Wh-clitic-doubling and wh-Cliticisation amount to direct evidence for Cliticisation as a derivational interpretive mechanism of Grammar that obviates the need for indexing (Lebeaux 1983, Chomsky 1986, 1995). They also provide evidence for the conclusion in Kayne (1989) that Cliticisation is an instance of Head-Movement, more precisely, feature-based Head-Movement. (shrink)

We show that the e-degree 0'e and the map u ↦ u' are definable in the upper semilattice of all e-degrees. The class of total e-degrees ≥0'e is also definable.

In [9]. Yates proved the existence of a Turing degree a such that 0. 0′ are the only c.e. degrees comparable with it. By Slaman and Steel [7], every degree below 0′ has a 1-generic complement, and as a consequence. Yates degrees can be 1-generic, and hence can be low. In this paper, we prove that Yates degrees occur in every jump class.

In [14] we used the term finitely algebraizable for algebraizable logics in the sense of Blok and Pigozzi [2] and we introduced possibly infinitely algebraizable, for short, p.i.-algebraizable logics. In the present paper, we characterize the hierarchy of protoalgebraic, equivalential, finitely equivalential, p.i.-algebraizable, and finitely algebraizable logics by properties of the Leibniz operator. A Beth-style definability result yields that finitely equivalential and finitely algebraizable as well as equivalential and p.i.-algebraizable logics can be distinguished by injectivity of the Leibniz (...) class='Hi'>operator. Thus, from a characterization of equivalential logics we obtain a new short proof of the main result of [2] that a finitary logic is finitely algebraizable iff the Leibniz operator is injective and preserves unions of directed systems. It is generalized to nonfinitary logics. We characterize equivalential and, by adding injectivity, p.i.-algebraizable logics. (shrink)

In this note we introduce and study algebras of type such that is a bounded distributive lattice and ⌝ is an operator that satisfies the condition ⌝ = a ⌝ b and ⌝ 0 = 1. We develop the topological duality between these algebras and Priestley spaces with a relation. In addition, we characterize the congruences and the subalgebras of such an algebra. As an application, we will determine the Priestley spaces of quasi-Stone algebras.

Tarski presented his definition of consequence operator to explain the most important notions which any logical consequence concept must contemplate. A Tarski space is a pair constituted by a nonempty set and a consequence operator. This structure characterizes an almost topological space. This paper presents an algebraic view of the Tarski spaces and introduces a modal propositional logic which has as a model exactly the closed sets of a Tarski space. • DOI:10.5007/1808-1711.2010v14n1p47.

Context: The question of how to understand the epistemology of set theory has been a longstanding problem in the foundations of mathematics since Cantor formulated the theory in the 19th century, and particularly since Bertrand Russell articulated his paradox in the early twentieth century. The theory of types pioneered by Russell and Whitehead was simplified by mathematicians to a single distinction between sets and classes. The question of the meaning of this distinction and its necessity still remains open. Problem: I (...) am concerned with the meaning of the set/class distinction and I wish to show that it arises naturally due to the nature of the sort of distinctions that sets create. Method: The method of the paper is to discuss first the Russell paradox and the arguments of Cantor that preceded it. Then we point out that the Russell set of all sets that are not members of themselves can be replaced by the Russell operator R, which is applied to a set S to form R(S), the set of all sets in S that are not members of themselves. Results: The key point about R(S) is that it is well-defined in terms of S, and R(S) cannot be a member of S. Thus any set, even the simplest one, is incomplete. This provides the solution to the problem that I have posed. It shows that the distinction between sets and classes is natural and necessary. Implications: While we have shown that the distinction between sets and classes is natural and necessary, this can only be the beginning from the point of view of epistemology. It is we who will create further distinctions. And it is up to us to maintain these distinctions, or to allow them to coalesce. Constructivist content: I argue in favor of a constructivist perspective for set theory, mathematics, and the way these structures fit into our natural language and constructed speech and worlds. That is the point of this paper. It is only in the reach for absolutes, ignoring the fact that we are the authors of these structures, that the paradoxes arise. (shrink)

In this paper two systems of AGM-like Paraconsistent Belief Revision are overviewed, both defined over Logics of Formal Inconsistency (LFIs) due to the possibility of defining a formal consistency operator within these logics. The AGM° system is strongly based on this operator and internalize the notion of formal consistency in the explicit constructions and postulates. Alternatively, the AGMp system uses the AGM-compliance of LFIs and thus assumes a wider notion of paraconsistency - not necessarily related to the notion (...) of formal consistency. (shrink)

The minimal weakening \ of Belnap-Dunn logic under the polarity semantics for negation as a modal operator is formulated as a sequent system which is characterized by the class of all birelational frames. Some extensions of \ with additional sequents as axioms are introduced. In particular, all three modal negation logics characterized by a frame with a single state are formalized as extensions of \. These logics have the finite model property and they are decidable.

It was shown in [3] (see also [5]) that there is a duality between the category of bounded distributive lattices endowed with a join-homomorphism and the category of Priestley spaces endowed with a Priestley relation. In this paper, bounded distributive lattices endowed with a join-homomorphism, are considered as algebras and we characterize the congruences of these algebras in terms of the mentioned duality and certain closed subsets of Priestley spaces. This enable us to characterize the simple and subdirectly irreducible algebras. (...) In particular, Priestley relations enable us to characterize the congruence lattice of the Q-distributive lattices considered in [4]. Moreover, these results give us an effective method to characterize the simple and subdirectly irreducible monadic De Morgan algebras [7].The duality considered in [4], was obtained in terms of the range of the quantifiers, and such a duality was enough to obtain the simple and subdirectly irreducible algebras, but not to characterize the congruences. (shrink)

In theTractatus, Wittgenstein advocates two major notational innovations in logic. First, identity is to be expressed by identity of the sign only, not by a sign for identity. Secondly, only one logical operator, called “N” by Wittgenstein, should be employed in the construction of compound formulas. We show that, despite claims to the contrary in the literature, both of these proposals can be realized, severally and jointly, in expressively complete systems of first-order logic. Building on early work of Hintikka’s, (...) we identify three ways in which the first notational convention can be implemented, show that two of these are compatible with the text of theTractatus, and argue on systematic and historical grounds, adducing posthumous work of Ramsey’s, for one of these as Wittgenstein’s envisaged method. With respect to the second Tractarian proposal, we discuss how Wittgenstein distinguished between general and non-general propositions and argue that, claims to the contrary notwithstanding, an expressively adequate N-operator notation is implicit in theTractatuswhen taken in its intellectual environment. We finally introduce a variety of sound and complete tableau calculi for first-order logics formulated in a Wittgensteinian notation. The first of these is based on the contemporary notion of logical truth as truth in all structures. The others take into account the Tractarian notion of logical truth as truth in all structures over one fixed universe of objects. Here the appropriate tableau rules depend on whether this universe is infinite or finite in size, and in the latter case on its exact finite cardinality.As it is obviously easy to express how propositions can be constructed by means of this operation and how propositions are not to be constructed by means of it, this must be capable of exact expression.5.503. (shrink)

Following Birkhoff and von Neumann, quantum logic has traditionally been based on the lattice of closed linear subspaces of some Hubert space, or, more generally, on the lattice of projections in a von Neumann algebra A. Unfortunately, the logical interpretation of these lattices is impaired by their nondistributivity and by various other problems. We show that a possible resolution of these difficulties, suggested by the ideas of Bohr, emerges if instead of single projections one considers elementary propositions to be families (...) of projections indexed by a partially ordered set C(A) of appropriate commutative subalgebras of A. In fact, to achieve both maximal generality and ease of use within topos theory, we assume that A is a so-called Rickart C*-algebra and that C(A) consists of all unital commutative Rickart C*-subalgebras of A. Such families of projections form a Hey ting algebra in a natural way, so that the associated propositional logic is intuitionistic: distributivity is recovered at the expense of the law of the excluded middle. Subsequently, generalizing an earlier computation for n x n matrices, we prove that the Heyting algebra thus associated to A arises as a basis for the internal Gelfand spectrum (in the sense of Banaschewski-Mulvey) of the "Bohrification" A̱ of A, which is a commutative Rickart C*-algebra in the topos of functors from C(A) to the category of sets. We explain the relationship of this construction to partial Boolean algebras and Bruns-Lakser completions. Finally, we establish a connection between probability measures on the lattice of projections on a Hubert space H and probability valuations on the internal Gelfand spectrum of A̱ for A = B(H). (shrink)

In the debate between relativism and contextualism about various expressions, the Operator Argument, initially proposed by Kaplan , has been taken to support relativism. However, one widespread reaction against the argument has taken the form of arguing against one assumption made by Kaplan: namely, that certain natural language expressions are best treated as sentential operators. Focusing on the only extant version of the Operator Argument proposed in connection to predicates of personal taste such as “tasty” and experiencer phrases (...) such as “for Anna” ), in this paper I investigate whetherthe reasons offered by Cappelen and Hawthorne against various assumptions of the argument failing in the case of modal, temporal, locationaland precisional expressions transfer to the case of experiencer phrases to undercut support for relativism about predicates of personal taste. My aim is to show that they don’t. Thus, I first show that their considerations against experiencer phrases such as “for Anna” being sentential operators are not decisive. Second, I show that even if granting that such experiencer phrases are not sentential operators, a suitably modified version of the Operator Argument can be defended from the objections they raise. (shrink)

The power of Wittgenstein's N operator described in the Tractatus is that every proposition which can be expressed in the Russellian variant of the predicate calculus familiar to him has an equivalent proposition in an extended variant of his N operator notation. This remains true if the bound variables are understood in the usual inclusive sense or in Wittgenstein's restrictive exclusive sense. The problematic limit of Wittgenstein's N operator comes from his claim that symbols alone reveal the (...) logical status of propositions. This would require knowledge of the size of the Tractarian domain of unchangeable, simple objects, and this, Wittgenstein maintained, cannot be known. (shrink)

This paper studies, by way of an example, the intuitionistic propositional connective * defined in the language of second order propositional logic by * ≡ ∃Q. In full topological models * is not generally definable but over Cantor-space and the reals it can be classically shown that *↔ ⅂⅂P; on the other hand, this is false constructively, i.e. a contradiction with Church's thesis is obtained. This is comparable with some well-known results on the completeness of intuitionistic first-order predicate logic. Over (...) [0, 1], the operator * is undefinable. We show how to recast this argument in terms of intuitive intuitionistic validity in some parameter. The undefinability argument essentially uses the connectedness of [0, 1]; most of the work of recasting consists in the choice of a suitable intuitionistically meaningful parameter, so as to imitate the effect of connectedness. Parameters of the required kind can be obtained as so-called projections of lawless sequences. (shrink)