Tarski and Mautner proposed to characterize the "logical" operations on a given domain as those invariant under arbitrary permutations. These operations are the ones that can be obtained as combinations of the operations on the following list: identity; substitution of variables; negation; finite or infinite disjunction; and existential quantification with respect to a finite or infinite block of variables. Inasmuch as every operation on this list is intuitively "logical", this lends support to the Tarski-Mautner proposal.

I present a notion of invariance under arbitrary surjective mappings for operators on a relational finite type hierarchy generalizing the so-called Tarski-Sher criterion for logicality and I characterize the invariant operators as definable in a fragment of the first-order language. These results are compared with those obtained by Feferman and it is argued that further clarification of the notion of invariance is needed if one wants to use it to characterize logicality.

We show that logic has more to offer to ontologists than standard first order and modal operators. We first describe some operators of linear logic which we believe are particularly suitable for ontological modeling, and suggest how to interpret them within an ontological framework. After showing how they can coexist with those of classical logic, we analyze three notions of artifact from the literature to conclude that these linear operators allow for reducing the ontological commitment needed for (...) their formalization, and even simplify their logical formulation. (shrink)

We generalize, by a progressive procedure, the notions of conjunction and disjunction of two conditional events to the case of n conditional events. In our coherence-based approach, conjunctions and disjunctions are suitable conditional random quantities. We define the notion of negation, by verifying De Morgan’s Laws. We also show that conjunction and disjunction satisfy the associative and commutative properties, and a monotonicity property. Then, we give some results on coherence of prevision assessments for some families of compounded conditionals; in particular (...) we examine the Fréchet-Hoeffding bounds. Moreover, we study the reverse probabilistic inference from the conjunction Cn+1 of n + 1 conditional events to the family {Cn,En+1|Hn+1}. We consider the relation with the notion of quasi-conjunction and we examine in detail the coherence of the prevision assessments related with the conjunction of three conditional events. Based on conjunction, we also give a characterization of p-consistency and of p-entailment, with applications to several inference rules in probabilistic nonmonotonic reasoning. Finally, we examine some non p-valid inference rules; then, we illustrate by an example two methods which allow to suitably modify non p-valid inference rules in order to get inferences which are p-valid. (shrink)

I present a notion of invariance under arbitrary surjective mappings for operators on a relational finite type hierarchy generalizing the so-called Tarski-Sher criterion for logicality and I characterize the invariant operators as definable in a fragment of the first-order language. These results are compared with those obtained by Feferman and it is argued that further clarification of the notion of invariance is needed if one wants to use it to characterize logicality.

This is a purely conceptual paper. It aims at presenting and putting into perspective the idea of a proof-theoretic semantics of the logical operations. The first section briefly surveys various semantic paradigms, and Section 2 focuses on one particular paradigm, namely the proof-theoretic semantics of the logical operations.

We discuss an abstract notion of a logical operation and corresponding logics. It is shown that if all the logical operations considered are implicitely definable in a logic *, then the same holds also for the logic obtained from these operations. As an application we show that certain iterated forms of infinitely deep languages are implicitely definable in game quantifier languages. We consider also relations between structures and show that Karttunen's characterization of elementary equivalence for the ordinary infinitely (...) deep languages can be generalized to hold for the iterated infinitely deep languages. An early version of this work was presented in the Abstracts Section of ICM '78. (shrink)

We revisit a typological puzzle due to Horn (Doctoral Dissertation, UCLA, 1972) regarding the lexicalization of logical operators: in instantiations of the traditional square of opposition across categories and languages, the O corner, corresponding to ‘nand’ (= not and), ‘nevery’ (= not every), etc., is never lexicalized. We discuss Horn’s proposal, which involves the interaction of two economy conditions, one that relies on scalar implicatures and one that relies on markedness. We observe that in order to express markedness (...) and to account for a bigger typological puzzle, namely the absence of lexicalizations of ‘XOR’ (= exclusive or), ‘all-or-none’, and many other imaginable logical operators, one must restrict the basic lexicalizable elements to a small set of primitives. We suggest that an ordering based perspective, following Keenan and Faltz (Boolean semantics for natural language, 1985), makes the stipulated primitives that we arrive at more natural. We also propose a modification to Horn’s proposal, based on recent work on implicatures, in which only the implicature condition is operative and in which markedness is part of the definition of the alternatives for scalar implicatures rather than an independent condition. (shrink)

Tautology is interpreted as a necessary condition for the workability of an operations system. This condition suggests the following possibilities: the stable solvability of balance equations between available resources and requests for them; the calculation of potential and kinetic of the system together with the estimation of the contribution of every operation to the kinetic of the system; the construction of a deadlockless infinite cyclic process for performance of some works.

I consider how complex logical operations might self-assemble in a signalling-game context via composition of simpler underlying dispositions. On the one hand, agents may take advantage of pre-evolved dispositions; on the other hand, they may co-evolve dispositions as they simultaneously learn to combine them to display more complex behaviour. In either case, the evolution of complex logical operations can be more efficient than evolving such capacities from scratch. Showing how complex phenomena like these might evolve provides an additional (...) path to the possibility of evolving more or less rich notions of compositionality. This helps provide another facet of the evolutionary story of how sufficiently rich, human-level cognitive or linguistic capacities may arise from simpler precursors. 1Signalling and Self-assembly2Simple Unary Logic Games3Composing Unary Functions for Binary Inputs 3.1Utilizing pre-evolved dispositions3.2Co-evolving logical dispositions3.3Learning appropriate outputs3.4Taking account of the full state-space of unary games3.5Role-free composition4Discussion 4.1Efficacy and efficiency of learning complex dispositions4.2Other binary operations4.3To infinity and beyond5Conclusion. (shrink)

In John Dewey’s logical theory, qualities or qualitative relations account for the capacity to distinguish and associate the objects of reflective thought; they are antecedent to reflective analysis and necessary for coherent processes of inquiry. In Dewey’s writings that are specifically “metaphysical” in orientation, he is much more vague about the function of qualities, but does call them “generic traits of existence.” As such, they appear to be central to his mature ontological theory. In order to more fully understand (...) the metaphysical import of qualitative relations, I first examine the details of Dewey’s logical theory, and then generalize those details in accordance with Dewey’s larger theory of nature. The end result is a novel interpretation of Dewey’s metaphysics. (shrink)

The concept of an operator is used in a variety of practical and theoretical areas. Operators, as both conceptual and physical entities, are found throughout the world as subsystems in nature, the human mind, and the manmade world. Operators, and what they operate, i.e., their substrates, targets, or operands, have a wide variety of forms, functions, and properties. Operators have explicit philosophical significance. On the one hand, they represent important ontological issues of reality. On the other hand, (...) epistemological operators form the basic mechanism of cognition. At the same time, there is no unified theory of the nature and functions of operators. In this work, we elaborate a detailed analysis of operators, which range from the most abstract formal structures and symbols in mathematics and logic to real entities, human and machine, and are responsible for effecting changes at both the individual and collective human levels. Our goal is to find what is common in physical objects called operators and abstract mathematical structures, with the name operator providing foundations for building a unified but flexible theory of operators. The paper concludes with some reflections on functionalism and other philosophical aspects of the ‘operation’ of operators. (shrink)

In what follows, the difference between Frege’s and Schröder’s understanding of logical connectives will be investigated. It will be argued that Frege thought of logical connectives as concepts, whereas Schröder thought of them as operations. For Frege, logical connectives can themselves be connected. There is no substantial difference between the connectives and the concepts they connect. Frege’s distinction between concepts and objects is central to this conception, because it allows a method of concept formation which enables us (...) to form concepts from the logical connectives alone. Schröder in contrast unifies the distinction between concepts and objects, but keeps the distinction between logical connectives and what they connect. It will be argued that Frege’s particular way of perceiving logical connectives is crucial for his foundational project. (shrink)

where F is a contradiction (I use his numbering). Tim says about these equivalences: (1) “modulo the implicit recognition of this equivalence, the epistemology of metaphysically modal thinking is a special case of the epistemology of counterfactual thinking. Whoever has what it takes to understand the counterfactual conditional and the elementary logical auxiliaries ~ and F has what it takes to understand possibility and necessity operators.” (158) (2) The idea that we evaluate metaphysically modal claims “by some quite (...) different means [from those we use to evaluate counterfactuals – CP] is highly fanciful, since it indicates a bizarre lack of cognitive economy and has no plausible explanation of where the alternative cognitive resources might come from” (162) (3) “the capacity to handle metaphysical modality is an “accidental” byproduct of the cognitive mechanisms that provide our capacity to handle counterfactual conditionals” (162). The biconditional corresponding to a proposed definition of a concept C may be necessary and a priori. But that leaves open these questions: (1) Does the definition contribute to an explanation of why what are in fact truths containing C are true? (The Explanation Question) (2) Does the definition contribute to an explanation of our knowledge of certain contents containing C? (Epistemic Question) (3) Does the definition contribute to an explanation of our understanding or grasp of contents containing C? (Understanding Question) I argue that applied to (17) and (18), considered as definitions, the answers to these three.. (shrink)

In this paper, we define for the first time three neutrosophic actions and their properties. We then introduce the prevalence order on {T, I, F} with respect to a given neutrosophic operator “o”, which may be subjective - as defined by the neutrosophic experts; and the refinement of neutrosophic entities <A>, <neutA>, and <antiA> . Then we extend the classical logical operators to neutrosophic literal logical operators and to refined literal logical operators, and we (...) define the refinement neutrosophic literal space. (shrink)

I examine the ideas leading up to Wittgenstein's pronouncement at Tractatus 5.4611 that signs for logical operations are punctuation marks.

The paper proposes a semantic value for the logical constants (connectives and quantifiers) within the framework of proof-theoretic semantics, basic meaning on the introduction rules of a meaning conferring natural deduction proof system. The semantic value is defined based on Fregecontributions” to sentential meanings as determined by the function-argument structure as induced by a type-logical grammar. In doing so, the paper proposes a novel proof-theoretic interpretation of the semantic types, traditionally interpreted in Henkin models. The compositionality of the (...) resulting attribution of semantic values is discussed. Elsewhere, the same method was used for defining proof-theoretic meaning of subsentential phrases in a fragment of natural language. Doing the same for (the simpler and clearer case of) logic sheds more light on the proposal. (shrink)

Let K = (p, q...; &, ∨, ~) be a zeroth-order formal language with sentence variables p, q..., two place connectives & (and), ∨ (or) and negation sign ~, and let F be the formula algebra (set of well-formed formulas in K defined in the standard way by induction from the sentence variables). If v is an assignment of truth values 1(true), 0(f alse) to the sentence variables p, q..., then classical propositional logic is characterized by extending v by induction (...) from p, q... to the formula algebra F in such a manner that the extension (called interpretation and also denoted by v) be a “homomorphism” from F into the two-element Boolean algebra B 2 ≡ (1, 0, ⋂, ⋃, ⊥), where “homomorphism” means that the following hold υ(q&p)=υ(q)∩υ(p)υ(q∨p)=υ(q)∪υ(p)υ(∼q)=υ(q)⊥. (shrink)

In this paper, we approach the problem of classical recapture for LP and K3 by using normality operators. These generalize the consistency and determinedness operators from Logics of Formal Inconsistency and Underterminedness, by expressing, in any many-valued logic, that a given formula has a classical truth value (0 or 1). In particular, in the rst part of the paper we introduce the logics LPe and Ke3 , which extends LP and K3 with normality operators, and we establish (...) a classical recapture result based on the two logics. In the second part of the paper, we compare the approach in terms of normality operators with an established approach to classical recapture, namely minimal inconsistency. Finally, we discuss technical issues connecting LPe and Ke3 to the tradition of Logics of Formal Inconsistency and Underterminedness. (shrink)

The logic with independent truth and falsehood operators TFL is proposed. In TFL(→) standard truth-conditions for the implication are adopted. Nevertheless the laws of classical logic are not valid. In this language more then 107 different binary connectives can be defined. So this logic can be treated as universal logic relatively to the class of sentential logics.

Vector logic is a mathematical model of the propositional calculus in which the logical variables are represented by vectors and the logical operations by matrices. In this framework, many tautologies of classical logic are intrinsic identities between operators and, consequently, they are valid beyond the bivalued domain. The operators can be expressed as Kronecker polynomials. These polynomials allow us to show that many important tautologies of classical logic are generated from basic operators via the operations (...) called Type I and Type II products. Finally, it is described a matrix version of the Fredkin gate that extends its properties to the many-valued domain, and it is proved that the filtered Fredkin operators are second degree Kronecker polynomials that cannot be generated by Type I or Type II products. (shrink)

The properties of the ${\forall^{1}}$ quantifier defined by Kontinen and Väänänen in [13] are studied, and its definition is generalized to that of a family of quantifiers ${\forall^{n}}$ . Furthermore, some epistemic operators δ n for Dependence Logic are also introduced, and the relationship between these ${\forall^{n}}$ quantifiers and the δ n operators are investigated.The Game Theoretic Semantics for Dependence Logic and the corresponding Ehrenfeucht- Fraissé game are then adapted to these new connectives.Finally, it is proved that the (...) ${\forall^{1}}$ quantifier is not uniformly definable in Dependence Logic, thus answering a question posed by Kontinen and Väänänen in the above mentioned paper. (shrink)

We study a knowledge logic that assumes that to each set of agents, an indiscernibility relation is associated and the agents decide the membership of objects or states up to this indiscernibility relation. Its language contains a family of relative knowledge operators. We prove the decidability of the satisfiability problem, we show its EXPTIME-completeness and as a side-effect, we define a complete Hilbert-style axiomatization.

. In this paper, the significance of using general logic-systems and finite consequence operators defined on non-organized languages is discussed. Results are established that show how properties of finite consequence operators are independent from language organization and that, in some cases, they depend only upon one simple language characteristic. For example, it is shown that there are infinitely many finite consequence operators defined on any non-organized infinite language L that cannot be generated from any finite logic-system. On (...) the other hand, it is shown that for any nonempty language L, a set map is a finite consequence operator if and only if it is defined by a general logic-system. Simple logic-system examples that determine specific consequence operator properties are given. (shrink)

An essential part of natural language understanding, and hence of formal semantics, is the interpretation of temporal expressions. But the very variety of temporal phenomena---such as tense, aspect, aktionsart, temporal adverbials, and the temporal structure of extended text---has tended to result in formal semantic analyses using a wide variety of formal tools, often of a complex nature. It seems important to try and find unifying perspectives on this work, and above all, to try and gain some insight into the (...) class='Hi'>logical resources needed to deal with natural language temporal phenomena. (shrink)

Language employs various coordinators to connect propositions, a subset of which are “logical” in nature and thus analogous to the truth operators of formal logic. We here focus on two linguistic connectives and their negations: conjunction _and_ and (inclusive) disjunction _or_. Linguistic connectives exhibit a truth-conditional component as part of their meaning (their semantics), but their use in context can give rise to various implicatures and presuppositions (the domain of pragmatics) as well as to inferences that go beyond (...) semantic/pragmatic properties (the result of reasoning processes). We provide a comprehensive review of the role of the logical connectives in language and argue that three sets of factors—semantic, pragmatic, and those related to reasoning—are separate and separable, though some details may differ cross-linguistically. As a way to showcase the argument, we present two experiments in language comprehension in Spanish wherein pragmatic content was minimised and reasoning processes neutered, thus potentially highlighting what might be the default meanings of the connectives under study. In Experiment 1 we show that the conjunctive reading of inclusive disjunction is available in positive contexts other than in syntactically intricate cases such as downward entailing and free choice contexts, contrary to what has been claimed in the literature. In Experiment 2 we show that negated conjunctions and disjunctions in Spanish can easily receive the same interpretation when contrasted against the same context and, moreover, that these interpretations match those available in English, despite claims from the literature that linguistic connectives and local negation interact differently in English and Romance languages. (shrink)

Accretive and monotone operator theory are central branches of nonlinear functional analysis and constitute the abstract study of certain set-valued mappings between function spaces. This paper deals with the computational properties of these accretive and (generalized) monotone set-valued operators. In particular, we develop (and extend) for this field the theoretical framework of proof mining, a program in mathematical logic that seeks to extract computational information from prima facie “non-computational” proofs from the mainstream literature. To this end, we establish (...) class='Hi'>logical metatheorems that guarantee and quantify the computational content of theorems pertaining to accretive and (generalized) monotone set-valued operators. On the one hand, our results unify a number of recent case studies, while they also provide characterizations of central analytical notions in terms of proof theoretic ones on the other, which provides a crucial perspective on needed quantitative assumptions in future applications of proof mining to these branches. (shrink)

The standard notion of formal theory, in logic, is in general biased exclusively towards assertion: it commonly refers only to collections of assertions that any agent who accepts the generating axioms of the theory should also be committed to accept. In reviewing the main abstract approaches to the study of logical consequence, we point out why this notion of theory is unsatisfactory at multiple levels, and introduce a novel notion of theory that attacks the shortcomings of the received notion (...) by allowing one to take both assertions and denials on a par. This novel notion of theory is based on a bilateralist approach to consequence operators, which we hereby introduce, and whose main properties we investigate in the present paper. (shrink)

We shall describe the set of strongly meet irreducible logics in the lattice ϵLin.t of normal tense logics of weak orderings. Based on this description it is shown that all logics in ϵLin.t are independently axiomatizable. Then the description is used in order to investigate tense logics with respect to decidability, finite axiomatizability, axiomatization problems and completeness with respect to Kripke semantics. The main tool for the investigation is a translation of bimodal formulas into a language talking about partitions of (...) general frames into intervals so that relative to both Kripke frames and descriptive frames the expressive power of both languages coincides. (shrink)

The logic of quantum mechanical propositions—called quantum logic—is constructed on the basis of the operational foundation of logic. Some obvious modifications of the operational method, which come from the incommensurability of the quantum mechanical propositions, lead to the effective quantum logic. It is shown in this paper that in the framework of a calculization of this effective quantum logic the negation of a proposition is uniquely defined (Theorem I), and that a weak form of the quasimodular law can be derived (...) (Theorem II). Taking account of the definiteness of truth values for quantum mechanical propositions, the calculus of full quantum logic can be derived (Theorem III). This calculus represents an orthocomplemented quasimodular lattice which has as a model the lattice of subspaces of Hilbert space. (shrink)

We describe here a simple method in order to obtain programs from proofs in second-order classical logic. Then we extend to classical logic the results about storage operators proved by Krivine for intuitionistic logic. This work generalizes previous results of Parigot.

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)

In this paper the language of first-order modal logic is enriched with an operator @ ('actually') such that, in any model, the evaluation of a formula @A at a possible world depends on the evaluation of A at the actual world. The models have world-variable domains. All the logics that are discussed extend the classical predicate calculus, with or without identity, and conform to the philosophical principle known as serious actualism. The basic logic relies on the system K, whereas others (...) correspond to various properties that the actual world may have. All the logics are axiomatized. (shrink)

The logic of proofs was introduced by Artemov in order to analize the formalization of the concept of proof rather than the concept of provability. In this context, some operations on proofs play a very important role. In this paper, we investigate some very natural operations, paying attention not only to positive information, but also to negative information (i.e. information saying that something cannot be a proof). We give a formalization for a fragment of such a logic of proofs, and (...) we prove that our fragment is complete and decidable. (shrink)

The challenge for alethic pluralists to maintain a standard, truth-functional account of the logical operators has received some attention. In this paper, I consider a related but more fundamental challenge, to maintain a compositional account of the logical operators, which has received much less attention. I argue that, given natural assumptions, pluralists cannot answer this challenge.

In the paper, there is presented the theory of logical consequence operators indexed with taboo functions. It describes the mechanisms of logical inference in the environment of forbidden sentences. This kind of processes take place in ideological discourses within which their participants create various narrative worlds (mental worlds). A peculiar feature of ideological discourses is their association with taboo structures of deduction which penalize speech acts. The development of discourse involves, among others, transforming its deduction structure towards (...) the proliferation of consequence operators and modifying penalty functions. The presented theory enables to define various processes of these transformations in the precise way. It may be used in analyses of conflicts between competing elm experts acting within a discourse. (shrink)

This paper describes Peirce's systems of logic diagrams, focusing on the so-called ''existential'' graphs, which are equivalent to the first-order predicate calculus. It analyses their implications for the nature of mental representations, particularly mental models with which they have many characteristics in common. The graphs are intended to be iconic, i.e., to have a structure analogous to the structure of what they represent. They have emergent logical consequences and a single graph can capture all the different ways in which (...) a possibility can occur. Mental models share these properties. But, as the graphs show, certain aspects of propositions cannot be represented in an iconic or visualisable way. They include negation, and the representation of possibilities qua possibilities, which both require representations that do not depend on a perceptual modality. Peirce took his graphs to reveal the fundamental operations of reasoning, and the paper concludes with an analysis of different hypotheses about these operations. (shrink)

The general aim of this book is to provide an elementary exposition of some basic concepts in terms of which both classical and non-dassicallogirs may be studied and appraised. Although quantificational logic is dealt with briefly in the last chapter, the discussion is chiefly concemed with propo gjtional cakuli. Still, the subject, as it stands today, cannot br covered in one book of reasonable length. Rather than to try to include in the volume as much as possible, I have put (...) emphasis on some selected topics. Even these could not be roverrd completely, but for each topic I have attempted to present a detailed and precise t’Xposition of several basic results including some which are non-trivial. The roots of some of the central ideas in the volume go back to J. Luka siewicz’s seminar on mathematicallogi. (shrink)