In this paper, first, we determine the number of sublogics of variable inclusion of an arbitrary finitary logic ⊢ with a composition term. Then, we investigate their position into the lattice of co...

The aim of this article is to discuss pure variable inclusion logics, that is, logical systems where valid entailments require that the propositional variables occurring in the conclusion are included among those appearing in the premises, or vice versa. We study the subsystems of Classical Logic satisfying these requirements and assess the extent to which it is possible to characterise them by means of a single logical matrix. In addition, we semantically describe both of these companions to (...) Classical Logic in terms of appropriate matrix bundles and as semilattice-based logics, showing that the notion of consequence in these logics can be interpreted in terms of truth (or non-falsity) and meaningfulness (or meaninglessness) preservation. Finally, we use Płonka sums of matrices to investigate the pure variable inclusion companions of an arbitrary finitary logic. -/- . (shrink)

The paper aims at studying, in full generality, logics defined by imposing a variable inclusion condition on a given logic \. We prove that the description of the algebraic counterpart of the left variable inclusion companion of a given logic \ is related to the construction of Płonka sums of the matrix models of \. This observation allows to obtain a Hilbert-style axiomatization of the logics of left variable inclusion, to describe the (...) structure of their reduced models, and to locate them in the Leibniz hierarchy. (shrink)

In this article, we explore the semantic characterization of the (right) pure refined variable inclusion companion of all logics, which is a further refinement of the nowadays well-studied pure right variable inclusion logics. In particular, we will focus on giving a characterization of these fragments via a single logical matrix, when possible, and via a class of finite matrices, otherwise. In order to achieve this, we will rely on extending the semantics of the (...) class='Hi'>logics whose companions we will be discussing with infectious values in direct and in more subtle ways. This further establishes the connection between infectious logics and variable inclusion logics. (shrink)

Intermediate prepositional logics we consider here describe the setI() of regular informational types introduced by Yu. T. Medvedev [7]. He showed thatI() is a Heyting algebra. This algebra gives rise to the logic of infinite problems from [13] denoted here asLM 1. Some other definitions of negation inI() lead to logicsLM n (n ). We study inclusions between these and other systems, proveLM n to be non-finitely axiomatizable (n ) and recursively axiomatizable (n ). We also show that formulas (...) in one variable do not separateLM from Heyting's logicH, andLM n (n ) from Scott's logic (H+S). (shrink)

We present a plural logic that is as expressively strong as it can be without sacrificing axiomatisability, axiomatise it, and use it to chart the expressive limits set by axiomatisability. To the standard apparatus of quantification using singular variables our object-language adds plural variables, a predicate expressing inclusion (is/are/is one of/are among), and a plural definite description operator. Axiomatisability demands that plural variables only occur free, but they have a surprisingly important role. Plural description is not eliminable in favour (...) of quantification; on the contrary, quantification is definable in terms of it. Predicates and functors (function signs) can take plural as well as singular terms as arguments, and both many-valued and single-valued functions are expressible. The system accommodates collective as well as distributive predicates, and the condition for a predicate to be distributive is definable within it; similarly for functors. An essential part of the project is to demonstrate the soundness and completeness of the calculus with respect to a semantics that does without set-theoretic domains and in which the use of settheoretic extensions of predicates and functors is replaced by the sui generis relations and functions for which the extensions were at best artificial surrogates. Our metalanguage is designed to solve the difficulties involved in talking plurally about individuals and about the semantic values of plural items. (shrink)

Paraconsistent weak Kleene logic is the $3$-valued logic based on the weak Kleene matrices and with two designated values. In this paper, we investigate the poset of prevarieties of generalized involutive bisemilattices, focussing in particular on the order ideal generated by Α$\textrm{lg} $. Applying to this poset a general result by Alexej Pynko, we prove that, exactly like Priest’s logic of paradox, $\textrm{PWK}$ has only one proper nontrivial extension apart from classical logic: $\textrm{PWK}_{\textrm{E}}\textrm{,}$ PWK logic plus explosion. This $6$-valued logic, (...) unlike $\textrm{PWK} $, fails to be paraconsistent. We describe its consequence relation via a variable inclusion criterion and identify its Suszko-reduced models. (shrink)

In this essay, I argue for a view that inclusive positivists share with Ronald Dworkin. According to the Moral Incorporation Thesis (MIT), it is logically possible for a legal system to incorporate moral criteria of legality (or “grounds of law,” as Dworkin puts it). Up to this point, the debate has taken the shape of attacks on the coherence of MIT with the defender of MIT merely attempting to refute the attacking argument. I give a positive argument for MIT. I (...) begin with an explanation of the logic of establishing possibility claims, such as MIT. At the outset, it is worth noting that the logic of establishing possibility claims is very different from the logic of establishing contingent descriptive claims or necessary claims. For this reason, some explication of the relevant features of the semantics of modal logic will be necessary here. Once the structural framework is adequately developed, the argument for MIT will be grounded on the strength of a thought experiment of a surprisingly simple kind. Indeed, the argument is inspired by a Razian argument for the possibility of a legal system without coercive enforcement machinery; on his view, a society of angels could still have a system of law without any coercive machinery. My argument will possess two theoretically important qualities that are also possessed by Raz’s powerfully simple, but ultimately unsuccessful, argument. (shrink)

We present nested sequent systems for propositional Gödel-Dummett logic and its first-order extensions with non-constant and constant domains, built atop nested calculi for intuitionistic logics. To obtain nested systems for these Gödel-Dummett logics, we introduce a new structural rule, called the linearity rule, which (bottom-up) operates by linearising branching structure in a given nested sequent. In addition, an interesting feature of our calculi is the inclusion of reachability rules, which are special logical rules that operate by propagating (...) data and/or checking if data exists along certain paths within a nested sequent. Such rules require us to generalise our nested sequents to include signatures (i.e. finite collections of variables) in the first-order cases, thus giving rise to a generalisation of the usual nested sequent formalism. Our calculi exhibit favourable properties, admitting the height-preserving invertibility of every logical rule and the (height-preserving) admissibility of a large collection of structural and reachability rules. We prove all of our systems sound and cut-free complete, and show that syntactic cut-elimination obtains for the intuitionistic systems. We conclude the paper by discussing possible extensions and modifications, putting forth an array of structural rules that could be used to provide a sizable class of intermediate logics with cut-free nested sequent systems. (shrink)

One of the central logical ideas in Wittgenstein’sTractatus logico-philosophicusis the elimination of the identity sign in favor of the so-called “exclusive interpretation” of names and quantifiers requiring different names to refer to different objects and (roughly) different variables to take different values. In this paper, we examine a recent development of these ideas in papers by Kai Wehmeier. We diagnose two main problems of Wehmeier’s account, the first concerning the treatment of individual constants, the second concerning so-called “pseudo-propositions” (Scheinsätze) of (...) classical logic such as$a=a$or$a=b \wedge b=c \rightarrow a=c$. We argue that overcoming these problems requires two fairly drastic departures from Wehmeier’s account: (1) Not every formula of classical first-order logic will be translatable into asingleformula of Wittgenstein’s exclusive notation. Instead, there will often be a multiplicity of possible translations, revealing the original “inclusive” formulas to beambiguous. (2) Certain formulas of first-order logic such as$a=a$will not be translatable into Wittgenstein’s notation at all, being thereby revealed as nonsensical pseudo-propositions which should be excluded from a “correct” conceptual notation. We provide translation procedures from inclusive quantifier-free logic into the exclusive notation that take these modifications into account and define a notion of logical equivalence suitable for assessing these translations. (shrink)

We argue that some sign language loci (i.e. positions in signing space that realize discourse referents) are both formal variables and simplified representations of what they denote; in other words, they are simultaneously logical symbols and pictorial representations. We develop a 'formal semantics with iconicity' that accounts for their dual life; the key idea ('formal iconicity') is that some geometric properties of signs must be preserved by the interpretation function. We analyze in these terms three kinds of iconic effects in (...) American and French Sign Language (ASL and LSF): (i) structural iconicity, where relations of inclusion and complementation among loci are directly reflected in their denotations; (ii) locus-external iconicity, where the high or low position of a locus in signing space has a direct semantic reflex, akin to the semantic contribution of gender features of pronouns; and (iii) locus-internal iconicity, where different parts of a structured locus are targeted by different directional verbs, as was argued by Liddell and Kegl. The resulting semantics combines insights of two traditions that have been sharply divided by recent debates. In line with the 'formalist camp' (e.g. Lillo-Martin and Klima, Neidle, and Sandler and Lillo-Martin), our theory treats loci as variables, and develops an explicit formal analysis of their behavior. But we also incorporate insights of the 'iconic camp', which emphasized the role of iconic constraints in sign language in general and in pronominals in particular (e.g. Cuxac, Taub, Liddell). However, this synthesis is only possible if formal semantics makes provisions for iconic requirements at the very core of its interpretive procedure. (An Appendix discusses relevant data from Italian Sign Language [LIS].). (shrink)

In §93 of The Principles of Mathematics, Bertrand Russell observes that “the variable is a very complicated logical entity, by no means easy to analyze correctly”. This assessment is borne out by the fact that even now we have no fully satisfactory understanding of the role of variables in a compositional semantics for first-order logic. In standard Tarskian semantics, variables are treated as meaning-bearing entities; moreover, they serve as the basic building blocks of all meanings, which are constructed out (...) of variable assignments. But this has disquieting consequences, including Fine’s antinomy of the variable and an undue dependence of meanings on language. Here I develop an alternative, Fregean version of predicate logic that uses the traditional quantifier–variable apparatus for the expression of generality, possesses a fully compositional, non-representational semantics, and is not subject to the antinomy of the variable. The advantages of Fregean over Tarskian predicate logic are due to the former’s treating variables not as meaningful lexical items, but as mere marks of punctuation, similar to parentheses. I submit that this is indeed how the variables of predicate logic should be construed. (shrink)

The main aim of this paper is to introduce first-order versions of logics of evidence and truth, together with corresponding sound and complete Kripke semantics with variable and constant domains. According to the intuitive interpretation proposed here, these logics intend to represent possibly inconsistent and incomplete information bases over time. The paper also discusses the connections between Belnap-Dunn’s and da Costa’s approaches to paraconsistency, and argues that the logics of evidence and truth combine them in a (...) very natural way. (shrink)

Developing some suggestions of Ramsey (1925), elementary logic is formulated with respect to an arbitrary categorial system rather than the categorial system of Logical Atomism which is retained in standard elementary logic. Among the many types of non-standard categorial systems allowed by this formalism, it is argued that elementary logic with predicates of variable degree occupies a distinguished position, both for formal reasons and because of its potential value for application of formal logic to natural language and natural science. (...) This is illustrated by use of such a logic to construct a theory of quantity which is argued to be scientifically superior to existing theories of quantity based on standard categorial systems, since it yields real-valued scales without the need for unrealistic existence assumptions. This provides empirical evidence for the hypothesis that the categorial structure of the physical world itself is non-standard in this sense. (shrink)

ABSTRACTProbability judgements entail a conjunction fallacy if a conjunction is estimated to be more probable than one of its conjuncts. In the context of predication of alternative logical hypothesis, Bayesian logic provides a formalisation of pattern probabilities that renders a class of pattern-based CFs rational. BL predicts a complete system of other logical inclusion fallacies. A first test of this prediction is investigated here, using transparent tasks with clear set inclusions, varying in observed frequencies only. Experiment 1 uses data (...) where BL makes dominant predictions; Experiment 2's predictions were less clear, and we additionally investigated judgements about the second-most probable hypotheses. The results corroborated a pattern-probability account and cannot be easily explained by other theories of CFs. IFs were not limited to conjunctions, but rather occurred systematically for several logical connectives. Thus, pattern-based prob... (shrink)

An answer to the following question is presented: given a proof in classical propositional logic, for what small set of propositional variables p does it suffice to add all the formulae to Γ in order to intuitionistically prove A? This answer is an improvement of Ishihara's result for some cases.

Inclusivity is widely considered a requirement of defensible environmental risk consultations and is often either mandated or recommended to help ensure attention to stakeholders’ diverse views. Experience suggests the opposite: the emphasis on an inclusive consultation process often makes it impossible for decision makers to listen carefully to stakeholders and for citizens’ views to influence the design and choice of proposed actions. This paper briefly reviews the promise of environmental risk consultations before outlining several of the more serious problems associated (...) with an emphasis on inclusivity: long lists of undifferentiated concerns, facts tainted by stakeholders’ perspectives and worldviews, little access to clarifying dialogue or tests of expertise, few opportunities to scrutinize knowledge quality, avoidance of controversial issues, and an overwhelming abundance of information. As a result, the promotion of inclusivity often serves as a convenient excuse for decision makers to silence citizens by substituting quantity for quality, breadth for depth, and an adversarial approach for dialogue and informed understanding. (shrink)

Our aim is to provide a sequent calculus whose external consequence relation coincides with the three-valued paracomplete logic `of nonsense' introduced by Dmitry Bochvar and, independently, presented as the weak Kleene logic K3W by Stephen C. Kleene. The main features of this calculus are (i) that it is non-reflexive, i.e., Identity is not included as an explicit rule (although a restricted form of it with premises is derivable); (ii) that it includes rules where no variable-inclusion conditions are attached; (...) and (iii) that it is hybrid, insofar as it includes both left and right operational introduction as well as elimination rules. (shrink)

We are used to the idea that computers operate on numbers, yet another kind of data is equally important: the syntax of formal languages, with variables, binding, and alpha-equivalence. The original application of nominal techniques, and the one with greatest prominence in this paper, is to reasoning on formal syntax with variables and binding. Variables can be modelled in many ways: for instance as numbers (since we usually take countably many of them); as links (since they may `point' to a (...) binding site in the term, where they are bound); or as functions (since they often, though not always, represent `an unknown'). None of these models is perfect. In every case for the models above, problems arise when trying to use them as a basis for a fully formal mechanical treatment of formal language. The problems are practical—but their underlying cause may be mathematical. The issue is not whether formal syntax exists, since clearly it does, so much as what kind of mathematical structure it is. To illustrate this point by a parody, logical derivations can be modelled using a Gödel encoding (i.e., injected into the natural numbers). It would be false to conclude from this that proof-theory is a branch of number theory and can be understood in terms of, say, Peano's axioms. Similarly, as it turns out, it is false to conclude from the fact that variables can be encoded e.g., as numbers, that the theory of syntax-with-binding can be understood in terms of the theory of syntax-without-binding, plus the theory of numbers (or, taking this to a logical extreme, purely in terms of the theory of numbers). It cannot; something else is going on. What that something else is, has not yet been fully understood. In nominal techniques, variables are an instance of names, and names are data. We model names using urelemente with properties that, pleasingly enough, turn out to have been investigated by Fraenkel and Mostowski in the first half of the 20th century for a completely different purpose than modelling formal language. What makes this model really interesting is that it gives names distinctive properties which can be related to useful logic and programming principles for formal syntax. Since the initial publications, advances in the mathematics and presentation have been introduced piecemeal in the literature. This paper provides in a single accessible document an updated development of the foundations of nominal techniques. This gives the reader easy access to updated results and new proofs which they would otherwise have to search across two or more papers to find, and full proofs that in other publications may have been elided. We also include some new material not appearing elsewhere. (shrink)

We define a logic capable of expressing dependence of a variable on designated variables only. Thus has similar goals to the Henkin quantifiers of [4] and the independence friendly logic of [6] that it much resembles. The logic achieves these goals by realizing the desired dependence declarations of variables on the level of atomic formulas. By [3] and [17], ability to limit dependence relations between variables leads to existential second order expressive power. Our avoids some difficulties arising in the (...) original independence friendly logic from coupling the dependence declarations with existential quantifiers. As is the case with independence friendly logic, truth of is definable inside . We give such a definition for in the spirit of [11] and [2] and [1]. (shrink)

We show how Richard Jeffrey’s The Logic of Decision provides the proper formalism for calculating expected fitness for correlated encounters in general. As an illustration, some puzzles about kin selection are resolved.

We show how Richard Jeffrey's The Logic of Decision provides the proper formalism for calculating expected fitness for correlated encounters in general. As an illustration, some puzzles about kin selection are resolved.

Kaplan (1989a) insists that natural languages do not contain displacing devices that operate on character—such displacing devices are called monsters. This thesis has recently faced various empirical challenges (e.g., Schlenker 2003; Anand and Nevins 2004). In this note, the thesis is challenged on grounds of a more theoretical nature. It is argued that the standard compositional semantics of variable binding employs monstrous operations. As a dramatic first example, Kaplan’s formal language, the Logic of Demonstratives, is shown to contain monsters. (...) For similar reasons, the orthodox lambda-calculus-based semantics for variable binding is argued to be monstrous. This technical point promises to provide some far-reaching implications for our understanding of semantic theory and content. The theoretical upshot of the discussion is at least threefold: (i) the Kaplanian thesis that “directly referential” terms are not shiftable/bindable is unmotivated, (ii) since monsters operate on something distinct from the assertoric content of their operands, we must distinguish ingredient sense from assertoric content (cf. Dummett 1973; Evans 1979; Stanley 1997), and (iii) since the case of variable binding provides a paradigm of semantic shift that differs from the other types, it is plausible to think that indexicals—which are standardly treated by means of the assignment function—might undergo the same kind of shift. (shrink)

We prove that the set of properties describable by a uniform sequence of first-order sentences using at most k + 1 distinct variables is exactly equal to the set of properties checkable by a Turing machine in DSPACE[n k ] (where n is the size of the universe). This set is also equal to the set of properties describable using an iterative definition for a finite set of relations of arity k. This is a refinement of the theorem PSPACE = (...) VAR[O[1]] [8]. We suggest some directions for exploiting this result to derive trade-offs between the number of variables and the quantifier depth in descriptive complexity. (shrink)

In the last decades there has been a great controversy about the scientific status of emotion categories. This controversy stems from the idea that emotions are heterogeneous phenomena, which precludes classifying them under a common kind. In this article, I analyze this claim—which I call the Variability Thesis—and argue that as it stands, it is problematically underdefined. To show this, I examine a recent formulation of the thesis as offered by Scarantino (2015). On one hand, I raise some issues regarding (...) the logical structure of the claim. On the other hand, and most importantly, I show that the Variability Thesis requires a consensus about what counts as a relevant pattern of response in different domains, a consensus that is lacking in the current literature. This makes it difficult to assess what counts as evidence for or against this thesis. As a result, arguments based on the Variability Thesis are unwarranted. This raises serious concerns about some current empirical theories of emotions, but also sheds light on the issue of the scientific status of emotion categories. (shrink)

It has been claimed that counterpart theory cannot support a theory of actuality without rendering obviously invalid formulas valid or obviously valid formulas invalid. We argue that these claims are not based on logical flaws of counterpart theory itself, but point to the lack of appropriate devices in first-order logic for “remembering” the values of variables. We formulate a mildly dynamic version of first-order logic with appropriate memory devices and show how to base a version of counterpart theory with actuality (...) on this. This theory is, in special cases, equivalent to modal first-order logic with actuality, and apparently does not suffer from the logical flaws that have been mentioned in the literature. (shrink)

We present game-theoretic characterizations of the complexity/expressibility measures “dimension” and “the number of variables” as Least Fixed Point queries. As an example, we use these characterizations to compute the dimension and number of variables of Connectivity and Connectivity.

The educational aims described by educational philosophers rarely embrace the full range of differences in intellectual ability, adaptive behavior, or communication that children exhibit. Because envisioned educational aims have significant consequences for how educational practices, pedagogy, and curricula are conceptualized, the failure to acknowledge and embrace differences in ability leaves open the question of the extent to which students with intellectual disabilities are subject to the same aims as their “typically-developing” peers. In articulating and defending valued aims of education, educational (...) philosophers tacitly or expressly concede that particular aims will be ill suited to many children with intellectual disabilities, and that separate aims will therefore apply to them. This paper evaluates the philosophical reasoning behind this conclusion that some people, by necessity, must be governed by separate educational aims, to be decided separately and secondarily. The author calls this the “deferral stance.” First, the paper outlines concerns about a particular ability-biased social and epistemic context in which theorizing about educational aims takes place. The author then examines assumptions that underpin the logic of deferral, arguing that the logic proves flawed when subjected to conceptual and empirical scrutiny. The paper concludes by outlining an inclusive approach—the affirmative stance—to theorizing about educational aims that resists the logic of exclusion and deferral. (shrink)