In his famous work on vagueness, Russell named “fallacy of verbalism” the fallacy that consists in mistaking the properties of words for the properties of things. In this paper, I examine two (clusters of) mainstream paraconsistent logical theories – the non-adjunctive and relevant approaches –, and show that, if they are given a strongly paraconsistent or dialetheic reading, the charge of committing the Russellian Fallacy can be raised against them in a sophisticated way, by appealing to the intuitive reading of (...) their underlying semantics. The meaning of “intuitive reading” is clarified by exploiting a well-established distinction between pure and applied semantics. If the proposed arguments go through, the dialetheist or strong paraconsistentist faces the following Dilemma: either she must withdraw her claim to have exhibited true contradictions in a metaphysically robust sense – therefore, inconsistent objects and/or states of affairs that make those contradictions true; or she has to give up realism on truth, and embrace some form of anti-realistic (idealistic, or broadly constructivist) metaphysics. Sticking to the second horn of the Dilemma, though, appears to be promising: it could lead to a collapse of the very distinction, commonly held in the literature, between a weak and a strong form of paraconsistency – and this could be a welcome result for a dialetheist. (shrink)

We extend to the exponential connectives of linear logic the study initiated in Bucciarelli and Ehrhard 247). We define an indexed version of propositional linear logic and provide a sequent calculus for this system. To a formula A of indexed linear logic, we associate an underlying formula of linear logic, and a family A of elements of , the interpretation of in the category of sets and relations. Then A is provable in indexed linear logic iff the family A is (...) contained in the interpretation of some proof of . We extend to this setting the product phase semantics of indexed multiplicative additive linear logic introduced in Bucciarelli and Ehrhard , defining the symmetric product phase spaces. We prove a soundness result for this truth-value semantics and show how a denotational model of linear logic can be associated to any symmetric product phase space. Considering a particular symmetric product phase space, we obtain a new coherence space model of linear logic, which is non-uniform in the sense that the interpretation of a proof of !A−B contains informations about the behavior of this proof when applied to “chimeric” arguments of type A . In this coherence semantics, an element of a web can be strictly coherent with itself, or two distinct elements can be “neutral”. (shrink)

Kripke; possible-world semantics; pure and applied semantics; models of modal space; applicability.

In the context of propositional logics, we apply semantics modulo satisfiability—a restricted semantics which comprehends only valuations that satisfy some specific set of formulas—with the aim to efficiently solve some computational tasks. Three possible such applications are developed.We begin by studying the possibility of implicitly representing rational McNaughton functions in Łukasiewicz Infinitely-valued Logic through semantics modulo satisfiability. We theoretically investigate some approaches to such representation concept, called representation modulo satisfiability, and describe a polynomial algorithm that builds representations (...) in the newly introduced system. An implementation of the algorithm, test results and ways to randomly generate rational McNaughton functions for testing are presented. Moreover, we propose an application of such representations to the formal verification of properties of neural networks by means of the reasoning framework of Łukasiewicz Infinitely-valued Logic.Then, we move to the investigation of the satisfiability of joint probabilistic assignments to formulas of Łukasiewicz Infinitely-valued Logic, which is known to be an NP-complete problem. We provide an exact decision algorithm derived from the combination of linear algebraic methods with semantics modulo satisfiability. Also, we provide an implementation for such algorithm for which the phenomenon of phase transition is empirically detected.Lastly, we study the game theory situation of observable games, which are games that are known to reach a Nash equilibrium, however, an external observer does not know what is the exact profile of actions that occur in a specific instance; thus, such observer assigns subjective probabilities to players actions. We study the decision problem of determining if a set of these probabilistic constraints is coherent by reducing it to the problems of satisfiability of probabilistic assignments to logical formulas both in Classical Propositional Logic and Łukasiewicz Infinitely-valued Logic depending on whether only pure equilibria or also mixed equilibria are allowed. Such reductions rely upon the properties of semantics modulo satisfiability. We provide complexity and algorithmic discussion for the coherence problem and, also, for the problem of computing maximal and minimal probabilistic constraints on actions that preserves coherence.prepared by Sandro Márcio da Silva Preto.E-mail: [email protected]:https://doi.org/10.11606/T.45.2021.tde-17062021-163257. (shrink)

Modus ponens provides the central theme. There are laws, of the form A→C. A logic L collects such laws. Any datum A provides input to the laws of L. The central ternary relation R relates theories L,T and U, where U consists of all of the outputs C got by applying modus ponens to major premises from L and minor premises from T. Underlying this relation is a modus ponens product operation on theories L and T, whence RLTU iff LTU. (...) These ideas have been expressed, especially with Routley, as worlds semantics for relevant and other substructural logics.Worlds are best demythologized as theories, subject to truth-functional and other constraints. The chief constraint is that theories are taken as closed under logical entailment, which clearly begs the question if we are using the semantics to determine which theory L is Logic itself. Instead we draw the modal logicians’ conclusion—there are many substructural logics, each with its appropriate ternary relational postulates.Each logic L gives rise to a Calculus of L-theories, on which particular candidate logical axioms have the combinatorial properties expected from the well-known Curry–Howard isomorphism . We apply their bubbling lemma, updating the Fools Model of Combinatory Logic at the pure → level for the system BT. We make fusion an explicit connective, proving a combinator correspondence theorem. Having taken relevant → as a left residual for , we explore its right residual mate →r. Finally we concentrate on and prove a finite model property for the classical minimal relevant logic CB, a conservative extension of the minimal positive relevant logic B+. (shrink)

This work aims to make a critical and propositional exposition about the semantics of concepts in general, from the book Transcendental semantics of Kant (2000), by Loparic. In general terms, the exposition of the theme, by this author, focused on the general classification of the semantics of concepts, their meanings and referents. In turn, the critics was directed to several aspects of its exposition, such as: the precision of the nomenclature used, the introduction of new definitions and (...) the correction of others, the reformulation of the classification of the semantics of the concepts. Finally, the proposition highlighted three main points: (i) the conception of the equivalent epistemological status between logic and mathematics, as symbolic sciences with their own form and content; (ii) the weak and strong concept of sciences in general (formal and empirical) as pure and applied sciences, respectively; (iii) the possible metalinguistic conception of the semantics of concepts. (shrink)

This work aims to make a critical and propositional exposition about the semantics of concepts in general, from the book Transcendental semantics of Kant (2000), by Loparic. In general terms, the exposition of the theme, by this author, focused on the general classification of the semantics of concepts, their meanings and referents. In turn, the critics was directed to several aspects of its exposition, such as: the precision of the nomenclature used, the introduction of new definitions and (...) the correction of others, the reformulation of the classification of the semantics of the concepts. Finally, the proposition highlighted three main points: (i) the conception of the equivalent epistemological status between logic and mathematics, as symbolic sciences with their own form and content; (ii) the weak and strong concept of sciences in general (formal and empirical) as pure and applied sciences, respectively; (iii) the possible metalinguistic conception of the semantics of concepts. (shrink)

The assumption that it is possible to distinguish pure syntax from any semantic interpretation is common to contemporary extensionalist approaches to philosophy of language, mind, cognitive science, and artificial intelligence. The origin of the term 'pure syntax' is traced to Carnap's distinction between pure and applied syntax and semantics, and to formalist analyses of mathematical systems as uninterpreted token manipulating games. It is argued in opposition to this trend that syntax can never be purified entirely (...) of semantics, that there can be no such thing as meaningless syntactical tokens or uninterpreted symbols, but that tokens must always betoken and symbols always symbolize something. The implications of the myth of pure syntax in rule-structured and connectionist artificial intelligence, semantic network processing, and their philosophical-psychological rationales, are explored. The fact that rule-structured artificial intelligence in principle can simulate any connectionist model, and that rule-structured artificial intelligence presupposes the myth of pure syntax links the myth to traditional approaches and new paradigms in cognitive engineering. (shrink)

Nurses’ need to document activities is urgent. The panorama of available terminologies is heterogeneous. It seems necessary to understand the premises of available tools and their limits and benefits to make conscious choices and shape future development. Taxonomies (e.g., North American Nursing Diagnosis Association) and ‘pure terminologies’ (e.g., International Classification for Nursing Practice), or nursing languages, are available tools to document nurses’ activities and to produce theoretical models or reference systems. These tools respond first to a practical problem: ‘translating’ (...) nursing facts into linguistic descriptions. Taxonomies make reality describable through exhaustive definitions designed inductively. Thus, I argue that their philosophical basis is naïve semantics. Their framework is a closed hierarchy, that is, a system that provides defined levels of concepts, structured through dichotomous rules. This causes the problem of determining boundaries between concepts, and thus between phenomena, which I call the problem of ‘closing the concept enclosure’. Rigid metaphysical structures are unable to cope with the complexity of phenomena that nurses deal with, so they seem to be unable to describe them. I follow Wittgenstein's argument, from Philosophical Investigations, which is useful to understand this challenge: the definition of terms is not a problem of lack of suitable words or an agreed decision, but is achieved by training in practice. Pure terminologies give us another way to address the question. They are usually composed of a glossary of terms, paired with rules to combine them to manage meaning. They are more like natural language and this implies adapting more to phenomena. Then, I argue that their philosophical background is a pragmatic approach to language, and I discuss some consequences and objections. Finally, I find that the development of pure terminologies rather than taxonomies in documenting nursing activities allows us to achieve key objectives, such as improving nursing visibility and measurability in health records, without jeopardising person‐centred care. (shrink)

We study the notion of logical relation in the coherence space semantics of multiplicative-additive linear logic . We show that, when the ground-type logical relation is “closed under restrictions”, the logical relation associated to any type can be seen as a map associating facts of a phase space to families of points of the web of the corresponding coherence space. We introduce a sequent calculus extension of whose formulae denote these families of points. This logic admits a truth-value (...) class='Hi'>semantics in the previously mentioned phase space, and this truth-value semantics faithfully describes the logical relation model we started from. Then we generalize this notion of phase space, we prove a truth-value completeness result for and we derive from any phase model of a denotational model for . Using the truth-value completeness result, we obtain a weak denotational completeness result based on this new denotational semantics. (shrink)

A complete philosophy of mathematics must address Paul Benacerraf’s dilemma. The requirements of a general semantics for the truth of mathematical theorems that coheres also with the meaning and truth conditions for non-mathematical sentences, according to Benacerraf, should ideally be coupled with an adequate epistemology for the discovery of mathematical knowledge. Standard approaches to the philosophy of mathematics are criticized against their own merits and against the background of Benacerraf’s dilemma, particularly with respect to the problem of understanding the (...) distinction between pure and applied mathematics and the effectiveness of applied mathematics in the natural sciences and engineering. The evaluation of these alternatives provides the basis for articulating a philosophically advantageous Aristotelian inherence concept of mathematical entities. An inherence account solves Benacerraf’s dilemma by interpreting mathematical entities as nominalizations of structural spatiotemporal properties inhering in existent spatiotemporal entities. (shrink)

W. V. Quine famously defended two theses that have fallen rather dramatically out of fashion. The first is that intensions are “creatures of darkness” that ultimately have no place in respectable philosophical circles, owing primarily to their lack of rigorous identity conditions. However, although he was thoroughly familiar with Carnap’s foundational studies in what would become known as possible world semantics, it likely wouldn’t yet have been apparent to Quine that he was fighting a losing battle against intensions, due (...) in large measure to developments stemming from Carnap’s studies and culminating in the work of Kripke, Hintikka, and Bayart. These developments undermined Quine’s crusade against intensions on two fronts. First, in the context of possible world semantics, intensions could after all be given rigorous identity conditions by defining them (in the simplest case) as functions from worlds to appropriate extensions, a fact exploited to powerful and influential effect in logic and linguistics by the likes of Kaplan, Montague, Lewis, and Cresswell. Second, the rise of possible world semantics fueled a strong resurgence of metaphysics in contemporary analytic philosophy that saw properties and propositions widely, fruitfully, and unabashedly adopted as ontological primitives in their own right. This resurgence — happily, in my view — continues into the present day. -/- For a time, at any rate, Quine experienced somewhat better success with his second thesis: that higher-order logic is, at worst, confused and, at best, a quirky notational alternative to standard first-order logic. However, Quine notwithstanding, a great deal of recent work in formal metaphysics transpires in a higher-order logical framework in which properties and propositions fall into an infinite hierarchy of types of (at least) every finite order. Initially, the most philosophically compelling reason for embracing such a framework since Russell first proposed his simple theory of types was simply that it provides a relatively natural explanation of the paradoxes. However, since the seminal work of Prior there has been a growing trend to consider higher-order logic to be the most philosophically natural framework for metaphysical inquiry, many of the contributors to this volume being among the most important and influential advocates of this view. Indeed, this is now quite arguably the dominant view among formal metaphysicians. -/- In this paper, and against the current tide, I will argue in §1 that there are still good reasons to think that Quine’s second battle is not yet lost and that the correct framework for logic is first-order and type-free — properties and propositions, logically speaking, are just individuals among others in a single domain of quantification — and that it arises naturally out of our most basic logical and semantical intuitions. The data I will draw upon are not new and are well-known to contemporary higher-order metaphysicians. However, I will try to defend my thesis in what I believe is a novel way by suggesting that these basic intuitions ground a reasonable distinction between “pure” logic and non-logical theory, and that Russell-style semantic paradoxes of truth and exemplification arise only when we move beyond the purely logical and, hence, do not of themselves provide any strong objection to a type-free conception of properties and propositions. -/- Most of my arguments in §1 are largely independent of any specific account of the nature of properties and propositions beyond their type-freedom. However, I will in addition argue that there are good reasons to take propositions, at least, to be very fine-grained. My arguments are thus bolstered significantly if it can be shown that there are in fact well-defined examples of logics that are not only type-free but which comport with such a conception of propositions. It is the purpose of §2 to lay out a logic of this sort in some detail, drawing especially upon work by George Bealer and related work of my own. With the logic in place, it will be possible to generalize the line of argument noted above regarding Russell-style paradoxes and, in §3, apply it to two propositional paradoxes — the Prior-Kaplan paradox and the Russell-Myhill paradox — that are often taken to threaten the sort of account developed here. (shrink)

“Pure science” and “applied science” have peculiar histories in the United States. Both terms were in use in the early part of the nineteenth century, but it was only in the last decades that they took on new meanings and became commonplace in the discourse of American scientists. The rise in their currency reflected an acute concern about the corruption of character and the real possibilities of commercializing scientific knowledge. “Pure” was the preference of scientists who wanted (...) to emphasize their nonpecuniary motives and their distance from the marketplace. “Applied” was the choice of scientists who accepted patents and profits as other possible returns on their research. In general, the frequent conjoining of “pure” and “applied” bespoke the inseparable relations of science and capitalism in the Gilded Age. (shrink)

Many mathematicians have sought ‘pure’ proofs of theorems. There are different takes on what a ‘pure’ proof is, though, and it’s important to be clear on their differences, because they can easily be conflated. In this paper I want to distinguish between two of them.

A collection of papers read at the first Lexington Conference. Most of the papers argue for the relevance of phenomenological concepts to the theory and practice of psychiatry and psychoanalysis. Few new positions are advanced; the emphasis seems rather to have been on the review and consolidation of points established on previous occasions.—G. D. D.

In pure science, the standard approach to non-epistemic values is to exclude them as far as possible from scientific deliberations. When science is applied to practical decisions, non-epistemic values cannot be excluded. Instead, they have to be combined with scientific information in a way that leads to practically optimal decisions. A normative model is proposed for the processing of information in both pure and applied science. A general-purpose corpus of scientific knowledge, with high entry requirements, has (...) a central role in this model. Due to its high entry requirements, the information that it contains is sufficiently reliable for the vast majority of practical purposes. However, for some purposes, the corpus needs to be supplemented with additional information, such as scientific indications of danger that do not satisfy the entry requirements for the corpus. The role of non-epistemic values in the evaluation of scientific information should, as far as possible, be limited to determining the level of evidence required for various types of practical decisions. (shrink)

There are numerous contexts in which philosophers and others use model-theoretic methods in assessing the validity of ordinary arguments; consider, for example, the use of models built upon 'possible worlds' in examinations of modal arguments. But the relevant uses of model-theoretic techniques may seem to assume controversial semantic or metaphysical accounts of ordinary concepts. So, numerous philosophers have suggested that standard uses of model-theoretic methods in assessing the validity of modal arguments commit one to accepting that modal claims are to (...) be analysed in terms of possible worlds. The paper provides a very general account of how uses of model-theoretic methods in demonstrating facts about validity and invalidity may in fact often be uncoupled from controversial semantic or metaphysical theses, applying the resulting techniques to some modal cases in particular. (shrink)

In 1981, Paris and Wilkie raised the open question about whether and to what extent the axiom system did satisfy the Second Incompleteness Theorem under Semantic Tableaux deduction. Our prior work showed that the semantic tableaux version of the Second Incompleteness Theorem did generalize for the most common definition of appearing in the standard textbooks.However, there was an alternate interesting definition of this axiom system in the Wilkie–Paris article in the Annals of Pure and Applied Logic 35 , (...) pp. 261–302 which we did not examine in our year-2002 article in the Journal of Symbolic Logic. Our first goal is to show that the incompleteness results of our prior paper can generalize in this alternate context. We will also develop a formal analysis, using a new technique called Passive Induction, that is simpler than the formalism we had used before.A further reason our results are of interest is that we have shown in a companion paper published in Electronic Notes in Theoretical Computer Science 165 , pp. 213–226 that some very unorthodox axiomizations for are anti-thresholds for the Herbrandized version of the Second Incompleteness Theorem. Thus, different axiomizations for have nearly fully opposite incompleteness properties.This paper is self-contained. It will not require a knowledge of our earlier results. (shrink)

In this paper we give a rather detailed algebraic investigation of interpolation and Beth’s property in propositional many-valued logics extending Hájek’s Basic Logic [P. Hájek, Metamathematics of Fuzzy Logic, Kluwer, 1998], and we connect such properties with amalgamation and strong amalgamation in the corresponding varieties of algebras. It turns out that, while the most interesting extensions of in the language of have deductive interpolation, very few of them have Beth’s property or Craig interpolation. Thus in the last part of the (...) paper we look for conservative extensions of having such properties. (shrink)

This work is in two parts. The main aim of part 1 is a systematic examination of deductive, probabilistic, inductive and purely inductive dependence relations within the framework of Kolmogorov probability semantics. The main aim of part 2 is a systematic comparison of (in all) 20 different relations of probabilistic (in)dependence within the framework of Popper probability semantics (for Kolmogorov probability semantics does not allow such a comparison). Added to this comparison is an examination of (in all) (...) 15 purely inductive dependence relations. ————Part 1 leads in an axiomatic step-by-step development from the elementary classical truth value semantics of a sentential-logical language, called ‘L’, (chapter 1) to the elementary Kolmogorov probability semantics of L (chapter 2), which is then extended to four axiomatic semantical theories of dependence relations between the formulae of L. First the elementary Kolmogorov probability semantics of L is extended to a theory, called ‘Kdd’, of the relations of deductive dependence and deductive independence between formulae of L (chapter 3). Then Kdd is extended to a theory, called ‘Kpd1’, of the degree to which formulae of L probabilistically depend on each other in regard to a given probability distribution on the set of all formulae of L (chapter 4). Kpd1, in its turn, gets extended to a theory, called ‘Kpd2’, of the relations of probabilistic dependence and independence, relativized to unary Kolmogorov probability functions defined on L (chapter 5). Then Kpd2 is extended to a theory, called ‘Kid’, of the relations of inductive dependence and inductive independence, again relativized to unary Kolmogorov probability functions defined on L (chapter 6). Finally, Kid is extended to a theory, called ‘Kpid’, of the relations of purely inductive positive and negative dependence, relativized to unary Kolmogorov probability functions defined on L (chapter 7). ——Chapter 1, which deals with the familiar notions of truth value functions, tautologies, consequence relations and relations of logical opposition, is naturally the shortest chapter of part 1.——In chapter 2, the elementary classical semantics of L is extended to the elementary Kolmogorov probability semantics of L, i.e. to an axiomatic theory of unary and of binary Kolmogorov probability functions defined on the set of formulae of L. Because of the elementary character of this theory, chapter 2 is also rather short.——Chapter 3 introduces the first theory on dependence relations, to wit: Kdd, the theory of deductive (in)dependence between formulae of L. I follow here the well-known idea of Popper and Miller, who have used it in a famous discussion on the nature of probabilistic support for their arguments that probabilistic support is deductive, not inductive. I develop Kdd in the form of about 100 theorems, making ample use of the fact that deductive independence is nothing but subcontrary opposition, and close with a remark on the fundamental difference between deductive and logical dependence—two relations the ideas of which are all too easily mixed up.——Chapters 4 and 5 deal extensively with the traditional ideas of probabilistic (in)dependence, applied to formulae rather than to events. As always, I proceed axiomatically in a step-by-step process under systematic viewpoints and obtain about 300 theorems in this way. In the formulation of the theorems, I took special care to state clearly and expressly so-called tacit assumptions, especially those concerning the probability values of the formulae said to be dependent on each other. These assumptions are usually missing in the literature, due either to economy of writing or to sloppiness of thinking. Presumably, both chapters contain little that is new, their value lying more in the systematic grouping and organic development of the theorems than in the newness of these.——In chapter 6, I extend the axiomatic theory about probabilistic (in)dependence which has been elaborated in chapter 5, to an axiomatic theory of inductive (in)dependence by requiring of the relation of inductive (in)dependence that it be probabilistic (in)dependence, but not also logical implication or logical opposition. I point out the differences between probabilistic and inductive (in)dependence by means of some 60 theorems and close my examination of inductive (in)dependence by considering its relationship to the notion of support in the philosophy of science.——Finally, in chapter 7, the last of part 1, I take the step from inductive dependence to what I call ‘purely inductive dependence’ by combining the idea of inductive dependence with that of deductive independence in a way which is suggested by writings of Popper and Miller. I arrive at two noteworthy theorems. Firstly, there is indeed no purely inductive support. But secondly, and perhaps amazingly, countersupport is purely inductive.————Whereas the probabilistic framework of part 1 of the present work is Kolmogorov probability semantics, the framework of part 2 is Popper probability semantics, which is not only worth examining as a fascinating alternative to orthodox Kolmogorov probability semantics, but also allows us to examine dependence relations more deeply, than Kolmogorov probability semantics does. Part 2 leads—again in an axiomatic step-by-step development—from the basic Popper probability semantics of L, called ‘Pb’, (chapter 8) via a probabilistic theory of logical attributes, called ‘Ps’, (chapter 9) to four axiomatic semantical theories of dependence relations between the formulae of L. First, Ps is extended to a theory, called ‘Pdd’, of the relations of deductive dependence and deductive independence between formulae of L (chapter 10). Then Pdd is extended to a theory, called ‘Ppd’, of (in all) 20 relations of probabilistic (in)dependence, relativized to binary Popper probability functions defined on L (chapter 11). Ppd, in its turn, is extended to a theory, called ‘Pid’, of (in all) 10 relations of inductive dependence, again relativized to binary Popper probability functions defined on L (first part of chapter 12). Finally, Pid is extended to a theory, called ‘Ppid’, of (in all) 15 relations of purely inductive positive and negative dependence, relativized to binary Popper probability functions defined on L (second part of chapter 12).——Chapter 8, the first chapter of part 2 of the present work, is entirely preparatory. It introduces the axioms and about 180 theorems (150 of them together with their proofs) of basic Popper probability semantics in order to set this kind of semantics under way.——Then, in chapter 9, basic Popper probability semantics is extended to a probabilistic theory of logical properties of and relations between the formulae of L. Although I think that the way I did this extension is of some interest in itself, the main task of chapter 9 is again a preparatory one: to yield the indispensable lemmata (about 90 in number) for the theorems concerning probabilistic dependence relations in chapter 11 and concerning inductive dependence relations in chapter 12.——Chapter 10 brings the extension of Ps to the theory Pdd of deductive (in)dependence. Only half a dozen theorems are noted here for later use in the Pdd-extensions Ppd and Ppid. In view of the over 100 theorems already gained on this topic in the Kolmogorovian framework (cf. chapter 3), a similar extensive elaboration of Pdd would have been superfluous.——Chapter 11 is the most important one of part 2. It consists of a systematic comparison of 20 probabilistic (in)dependence concepts by means of about 230 theorems, obtained within the axiomatic theory Ppd, which is built up as an extension of Pdd. The main points of comparison were: differences in logical strength; reflexivity and symmetry; behaviour under the condition that the probability values of the formulae in question are extreme. It turned out that each of the examined concepts violates a strong and straightforward version of the intuitive requirement that probabilistic dependence should go with logical dependence. Whereas the corresponding chapter 5 in part 1 of the present work may not have led to new theorems, chapter 11 yields dozens of them in the process of comparison of concepts of dependence and independence which had—as far as I know—never before been treated in a single theoretical framework. With Popper probability semantics, this framework has become available, and here I have simply made full use of it.——In chapter 12, I extend the theory Ppd of probabilistic (in)dependence to the theories Pid and Ppid of inductive and purely inductive dependence, in a way very similar to that in which I have extended the theory Kpd2 to the theories Kid and Kpid in chapters 6 and 7. The first main result of Kpid (roughly: there is no purely inductive support) could be repeated for four of the five purely inductive positive dependence relations considered in chapter 12, whereas the second main result of Kpid (roughly: there is purely inductive countersupport ) could be repeated for each of the five examined purely inductive negative dependence relations. Chapter 12 closes with a brief recapitulation and critical discussion of the main results. (shrink)

Some interpreters have ascribed to Wittgenstein the view that mathematical statements must have an application to extra-mathematical reality in order to have use and so any statements lacking extra-mathematical applicability are not meaningful (and hence not bona fide mathematical statements). Pure mathematics is then a mere signgame of questionable objectivity, undeserving of the name mathematics. These readings bring to light that, on Wittgenstein’s offered picture of mathematical statements as rules of description, it can be difficult to see the role (...) of mathematical statements which relate to concepts that are not employed in empirical propositions e.g. set-theoretic concepts. I will argue that Wittgenstein’s picture is more flexible than might at first be thought and that Wittgenstein sees such statements as serving purposes not directly related to empirical description. Whilst this might make such systems fringe cases of mathematics, it does not bring their legitimacy as mathematical systems into question. (shrink)

Synesthesia is a phenomenon in which an additional nonstandard perceptual experience occurs consistently in response to ordinary stimulation applied to the same or another modality. Recent studies suggest an important role of semantic representations in the induction of synesthesia. In the present proposal we try to link the empirically grounded theory of sensory-motor contingency and mirror system based embodied simulation to newly discovered cases of swimming-style color synesthesia. In the latter color experiences are evoked only by showing the synesthetes (...) a picture of a swimming person or asking them to think about a given swimming style. Neural mechanisms of mirror systems seem to be involved here. It has been shown that for mirror-sensory synesthesia, such as mirror-touch or mirror-pain synesthesia, concurrent experiences are caused by the overactivity in the mirror neuron system responding to the specific observation. The comparison of different forms of synesthesia has the potential of challenging conventional thinking on this phenomenon and providing a more general, sensory-motor account of synesthesia encompassing cases driven by semantic or emulational rather than pure sensory or motor representations. (shrink)

This essay argues for the historicity of applied science as a contested category within laissez-faire Victorian British science. This distinctively pre-twentieth-century notion of applied science as a self-sustaining, autonomous enterprise was thrown into relief from the 1880s by a campaign on the part of T. H. Huxley and his followers to promote instead the primacy of “pure” science. Their attempt to relegate applied science to secondary status involved radically reconfiguring it as the mere application of pre-existing (...) pure science. This new notion of extrinsically funded pure science that would produce only contingently future social benefits as a mere by-product came under pressure during World War I, when military priorities focused attention once again on science for immediate utility. This threatened the Cambridge-based promoters of self-referential pure science who collectively published Science and the Nation in 1917. Yet most contributors to this work discussed forms of “applied” science that had no prior “pure” form. Even the U.K.'s leading government scientist, Lord Moulton, dismissed the book's provocative distinction between pure and applied science as unhelpfully “vague and artificial.”. (shrink)

The shriek modality \s! of linear logic performs two tasks: it restores in annotated from both weakening and contraction. We separate these tasks by introducing two modalities: for weakening and for contraction. These give rise to two logics which are “inbetween” linear and intuitionistic logic: in affine logic one always has a weakening and a for contraction and in relevant logic one always has a contraction and a weakening. The semantics of these logics is obtained from special kinds of (...) monads, introduced by Anders Kock in the early seventies. As subtle point is how to retrieve the \s! of linear logic from and . Technically this will be achieved in terms of distributive laws—introduced by Jon Beck. We find models where one has \s! = and also models with \s! = . It will be shown that on the category of complete lattices one has comonads and with = \s!=. (shrink)

Abramsky, S., Domain theory in logical form, Annals of Pure and Applied Logic 51 1–77. The mathematical framework of Stone duality is used to synthesise a number of hitherto separate developments in theoretical computer science.• Domain theory, the mathematical theory of computation introduced by Scott as a foundation for detonational semantics• The theory of concurrency and systems behaviour developed by Milner, Hennesy based on operational semantics.• Logics of programsStone duality provides a junction between semantics and (...) logics . Moreover, the underlying logic is geometric, which can be computationally interpreted as the logic of observable properties—i.e., properties which can be determined to hold of a process on the basis of a finite amount of information about its execution.These ideas lead to the following programme. A metalanguage is introduced, comprising• types = universes of discourse for various computational situations;• terms = PROGRAMS = syntactic intensions for models or points. A standard denotational interpretation of the metalanguage is given, assigning domains to types and domain elements to terms. The metalanguage is also given a logical interpretation, in which types are interpreted as propositional theories and terms are interpreted via a program logic, which axiomatises the properties they satisfy. The two interpretations are related by showing that they are Stone duals of each other. Hence, semantics and logic are guaranteed to be in harmony with each other, and in fact each determines the other up to isomorphism. This opens the way to a whole range of applications. Given a denotational description of a computational situation in our metalanguage, we can turn the handle to obtain a logic for that situation. (shrink)

We use formal semantic analysis based on new constructions to study abstract realizability, introduced by Läuchli in 1970, and expose its algebraic content. We claim realizability so conceived generates semantics-based intuitive confidence that the Heyting Calculus is an appropriate system of deduction for constructive reasoning.Well-known semantic formalisms have been defined by Kripke and Beth, but these have no formal concepts corresponding to constructions, and shed little intuitive light on the meanings of formulae. In particular, the completeness proofs for these (...) semantics do not generate confidence in the sufficiency of the Heyting Calculus, since we have no reason to believe that every intuitively constructive truth is valid in the formal semantics.Läuchli has proved completeness for a realizability semantics with formal concepts analogous to constructions. We argue in some detail that, in spite of a certain inherent inexactness of the analogy, every intuitively constructive truth is valid in Läuchli semantics, and therefore the Heyting Calculus is powerful enough to prove all constructive truths. Our argument is based on the postulate that a uniformly constructible object must be communicable in spite of imprecision in our language, and that the permutations in Läuchli's semantics represent conceivable imprecision in a language, while allowing a certain amount of freedom in choosing the particular structure of the language.We give a detailed generalization of Läuchli's proof of completeness for the propositional part of the Heyting Calculus, in order to make explicit constructive and algebraic content.In our treatment, we establish several new results about Läuchli models. We show how to extend the sconing and gluing constructions familiar from Kripke and Frame semantics and Topos theory, to Läuchli models, and use them to give an algebraic approach to countermodel construction. In particular, the Läuchli arguments are given without the restriction to the integers, Z, as a group of permutations, which makes much of the coding scheme used in Läuchli's original paper transparent.We also make use of a new propositions-as-types syntax for the Heyting calculus, with limited nondeterminism, in which validity of formulae can be decided without loop-detection. (shrink)

Regarding the dichotomy between applied science and pure science, there are two apparently paradoxical facts. First, they are distinguishable. Second, the outcomes of pure sciences (e.g. scientific theories and models) are applicable to producing the outcomes of applied sciences (e.g. technological artefacts) and vice versa. Addressing the functional roles of applied and pure science, i.e. to produce design representation and science representation, respectively, I propose a new characterisation of the dichotomy that explains these two (...) facts. (shrink)

The infinite-valued semantics was introduced in Rondogiannis and Wadge (2005) as a purely logical way for capturing the meaning of well-founded negation in logic programming. The purpose of this paper is threefold: first, to give a non-technical introduction to the infinite-valued semantics; second, to discuss the applicability of the infinite-valued approach to syntactically richer extensions of logic programming; and third, to present the main open problems whose resolution would further enhance the applicability of the technique.

This paper is a contribution to Mathematical fuzzy logic, in particular to the algebraic study of t-norm based fuzzy logics. In the general framework of propositional core and Δ-core fuzzy logics we consider three properties of completeness with respect to any semantics of linearly ordered algebras. Useful algebraic characterizations of these completeness properties are obtained and their relations are studied. Moreover, we concentrate on five kinds of distinguished semantics for these logics–namely the class of algebras defined over the (...) real unit interval, the rational unit interval, the hyperreals , the strict hyperreals and finite chains, respectively–and we survey the known completeness methods and results for prominent logics. We also obtain new interesting relations between the real, rational and hyperreal semantics, and good characterizations for the completeness with respect to the semantics of finite chains. Finally, all completeness properties and distinguished semantics are also considered for the first-order versions of the logics where a number of new results are proved. (shrink)

In the present paper, we start studying epistemic updates using the standard toolkit of duality theory. We focus on public announcements, which are the simplest epistemic actions, and hence on Public Announcement Logic without the common knowledge operator. As is well known, the epistemic action of publicly announcing a given proposition is semantically represented as a transformation of the model encoding the current epistemic setup of the given agents; the given current model being replaced with its submodel relativized to the (...) announced proposition. We dually characterize the associated submodel-injection map as a certain pseudo-quotient map between the complex algebras respectively associated with the given model and with its relativized submodel. As is well known, these complex algebras are complete atomic BAOs . The dual characterization we provide naturally generalizes to much wider classes of algebras, which include, but are not limited to, arbitrary BAOs and arbitrary modal expansions of Heyting algebras . Thanks to this construction, the benefits and the wider scope of applications given by a point-free, intuitionistic theory of epistemic updates are made available. As an application of this dual characterization, we axiomatize the intuitionistic analogue of PAL, which we refer to as IPAL, prove soundness and completeness of IPAL w.r.t. both algebraic and relational models, and show that the well known Muddy Children Puzzle can be formalized in IPAL. (shrink)

The proof of Lemma 5 in our paper “Choice Principles in Hyperuniverses” [3], contains an error. In the present note we show that the statement of that lemma is false and hence the Axiom of Choice fails in all κ-hyperuniverses, for uncountable κ. However, a weaker version of Lemma 5 can be proved, which implies that the Linear Ordering Principle holds in all κ-metric κ-hyperuniverses.

Sweet describes the pragmatic foundations of standard logic and applies these foundations to the task of developing a theory of intended models as an extension of standard model theory in which the relevant "intending" is represented pragmatically. Methods of formal logic are used to investigate the structure of the relation between language and the world. The truism which holds that this relation includes the speaker as well as the object spoken about is formally explicated and applied to the problem (...) of illuminating one of the deepest phenomena in standard model theory: the existence of non-isomorphic models of complete theories. To this end it is shown that standard logic admits pragmatic foundations upon which a theory of intended models can be built as an extension of standard model theory. The relevant "intending" is represented by the very forms of verbal behavior which determine the grammatical and logical structure of the sentences whose referential meaning is in question. The uniqueness properties of the class of intended models may then be described. The first section of the book states the immediate goal of standard pragmatics as that of recovering the algebraic structure first-order logic by means of a purely pragmatic construction. The second section, the major portion of the work, then provides the foundation for a semiotic theory of intended models and referential meaning. The theory is then applied to the problem of referential indeterminancy, which has been associated with the phenomenon of scientific revolutions. The theory is also applied to the problem of the apparent synonymy of observationally equivalent theories. Sweet concludes that such theories are not referentially synonymous in any natural sense which is analogous to the paradigm sense in which theories of alternative scales of measurement are referentially synonymous. A novel feature of this book is the formal explication of the idea that the factors, pragmatical in nature, which distinguish the actual meaning of a sentence from among its possible meanings, whose range is defined by the manner in which the sentence is parsed, determine that very parsing. Applicability to natural language of the model-theoretic semantics thereby obtained is made possible by another feature of the book: the development of a theory of locally standard grammar which provides the foundation for representing the structure of natural language as that of standard first-order logic, in a local, as distinguished from a global, sense. This book is intended for scholars in logic, semiotics, and the philosophies of language and of science. Those concerned specifically with such philosophers as Peirce, Martin, and Davidson will also find the study valuable. (shrink)