Logical Connectives, Misc

We discuss a well-known puzzle about the lexicalization of logical operators in natural language, in particular connectives and quantifiers. Of the many logically possible functions of the relevant type, only few appear in the lexicon of natural languages: the connectives in English, for example, are only 'and', 'or', and perhaps 'nor' (expressing negated disjunction). The logically possible 'nand' (negated conjunction) is not expressed by a lexical entry of English, or of any natural language. The explanation we propose is based on (...) the “dynamic” behaviour of connectives and quantifiers: we define update potentials for logical operator, under the assumption that the logical structure of a sentence p defines what type of update p contributes to context, together with the speech act performed (assertion or denial). We conjecture that the adequacy of update potentials determines the limits of lexicalizability for logical operators in natural language. (shrink)

The paper begins with a conceptual discussion of Michael Dummett's proof-theoretic justification of deduction or proof-theoretic semantics, which is based on what we might call Gentzen's thesis: 'the introductions constitute, so to speak, the "definitions" of the symbols concerned, and the eliminations are in the end only consequences thereof, which could be expressed thus: In the elimination of a symbol, the formula in question, whose outer symbol it concerns, may only "be used as that which it means on the basis (...) of the introduction of this symbol".' The intuitive philosophical content of Dummett's notions of harmony and stability is that harmony obtains if the grounds for asserting a proposition match the consequences of accepting it, and stability obtains if the converse also holds. Rules of inference define the meanings of a logical constant they govern if and only if they are stable. Gentzen observed that 'it should be possible to establish on the basis of certain requirements that the elimination rules are functions of the corresponding introduction rules.' One of the objectives of this paper is to specify such a function: I will specify a process by which it is possible to determine the elimination rules of logical constants from their introduction rules, and conversely, to determine the introduction rules from the elimination rules. I'll give the general forms of rules of inference and generalised reduction procedures for the normalisation of deduction. I'll give a formally precise characterisations of harmony and stability and show that deductions in logics that contain only constants governed by stable rules always normalise. (shrink)

In this article, we provide three generators of propositional formulae for arbitrary languages, which uniformly sample three different formulae spaces. They take the same three parameters as input, namely, a desired depth, a set of atomics and a set of logical constants (with specified arities). The first generator returns formulae of exactly the given depth, using all or some of the propositional letters. The second does the same but samples up-to the given depth. The third generator outputs formulae with exactly (...) the desired depth and all the atomics in the set. To make the generators uniform (i.e. to make them return every formula in their space with the same probability), we will prove various cardinality results about those spaces. (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)

In this paper we show how Dummett-Prawitz-style proof-theoretic semantics has to be modified in order to cope with paradoxical phenomena. It will turn out that one of its basic tenets has to be given up, namely the definition of the correctness of an inference as validity preservation. As a result, the notions of an argument being valid and of an argument being constituted by correct inference rules will no more coincide. The gap between the two notions is accounted for by (...) introducing the distinction between sense and denotation in the proof-theoretic-semantic setting. (shrink)

The use of the symbol ∨ for disjunction in formal logic is ubiquitous. Where did it come from? The paper details the evolution of the symbol ∨ in its historical and logical context. Some sources say that disjunction in its use as connecting propositions or formulas was introduced by Peano; others suggest that it originated as an abbreviation of the Latin word for “or”, vel. We show that the origin of the symbol ∨ for disjunction can be traced to Whitehead (...) and Russell’s pre-Principia work in formal logic. Because of Principia’s influence, its notation was widely adopted by philosophers working in logic (the logical empiricists in the 1920s and 1930s, especially Carnap and early Quine). Hilbert’s adoption of ∨ in his Grundzüge der theoretischen Logik guaranteed its widespread use by mathematical logicians. The origins of other logical symbols are also discussed. (shrink)

We argue that, if taken seriously, Kripke's view that a language for science can dispense with a negation operator is to be rejected. Part of the argument is a proof that positive logic, i.e., classical propositional logic without negation, is not categorical.

I argue against the skeptical epistemological view exemplified by the Groarkes that “all theories of informal argument must face the regress problem.” It is true that in our theoretical representations of reasoning, infinite regresses of self-justification regularly and inadvertently arise with respect to each of the RSA criteria for argument cogency (the premises are to be relevant, sufficient, and acceptable). But they arise needlessly, by confusing an RSA criterion with argument content, usually premise material.

Some philosophers have argued that putative logical disagreements aren't really disagreements at all since when you change your logic you thereby change the meanings of your logical constants. According to this picture classical logicians and intuitionists don't really disagree, they just mean different things by terms like “not” and “or”. Quine gave an infamous “translation argument” for this view. Here I clarify the change of logic, change of meaning (CLCM) thesis, examine and find fault with Quine's translation argument for the (...) thesis, offer a modified translation argument in its stead, defend my modified argument from a crucial objection, discuss where the CLCM thesis leaves logical disputes, and discuss if and how the thesis coheres with Quine's influential view of logic. (shrink)

According to the logical pluralism of Beall and Restall, there are several distinct relations of logical consequence. Some critics argue that logical pluralism suffers from what I call the collapse problem: that despite its intention to articulate a radically pluralistic doctrine about logic, the view unintentionally collapses into logical monism. In this paper, I propose a contextualist resolution of the collapse problem. This clarifies the mechanism responsible for a plurality of logics and handles the motivating data better than the original (...) view. It is a major improvement that should be embraced by all logical pluralists. (shrink)

This paper is a conceptual study in the philosophy of logic. The question considered is 'How may formulae of the propositional calculus be brought into a representational relation to the world?'. Four approaches are distinguished: (1) the denotational approach, (2) the abbreviational approach, (3) the truth-conditional approach, and (4) the modelling approach. (2) and (3) are very familiar, so I do not discuss them. (1), which is now largely obsolete, led to some interesting twists and turns in early analytic philosophy (...) which will come as news to many contemporary readers, so I discuss it in some detail. The modelling approach is, to the best of my knowledge, newly introduced here. I am not presenting it as a rival to the other approaches, but as a philosophically interesting possibility. (shrink)

Prior’s Tonk is a famously horrible connective. It is defined by its inference rules. My aim in this article is to compare Tonk with some hitherto unnoticed nasty connectives, which are defined in semantic terms. I first use many-valued truth-tables for classical sentential logic to define a nasty connective, Knot. I then argue that we should refuse to add Knot to our language. And I show that this reverses the standard dialectic surrounding Tonk, and yields a novel solution to the (...) problem of many-valued truth-tables for classical sentential logic. I close by outlining the technicalities surrounding nasty connectives on many-valued truth-tables. (shrink)

A logical constant is weakly disharmonious if its elimination rules are weaker than its introduction rules. Substructural weak disharmony is the weak disharmony generated by structural restrictions on the eliminations. I argue that substructural weak disharmony is not a defect of the constants which exhibit it. To the extent that it is problematic, it calls into question the structural properties of the derivability relation. This prompts us to rethink the issue of controlling the structural properties of a logic by means (...) of harmony. I argue that such a control is possible and desirable. Moreover, it is best achieved by global tests of harmony. (shrink)

In the recent paper “Naive modus ponens”, Zardini presents some brief considerations against an approach to semantic paradoxes that rejects the transitivity of entailment. The problem with the approach is, according to Zardini, that the failure of a meta-inference closely resembling modus ponens clashes both with the logical idea of modus ponens as a valid inference and the semantic idea of the conditional as requiring that a true conditional cannot have true antecedent and false consequent. I respond on behalf of (...) the non-transitive approach. I argue that the meta-inference in question is independent from the logical idea of modus ponens, and that the semantic idea of the conditional as formulated by Zardini is inadequate for his purposes because it is spelled out in a vocabulary not suitable for evaluating the adequacy of the conditional in semantics for non-transitive entailment. I proceed to generalize the semantic idea of the conditional and show that the most popular semantics for non-transitive entailment satisfies the new formulation. (shrink)

I argue that in order to apply the most common type of criteria for logicality, invariance criteria, to natural language, we need to consider both invariance of content—modeled by functions from contexts into extensions—and invariance of character—modeled, à la Kaplan, by functions from contexts of use into contents. Logical expressionsshould be invariant in both senses. If we do not require this, then old objections due to Timothy McCarthy and William Hanson, suitably modified, demonstrate that content invariant expressions can display intuitive (...) marks of non-logicality. If we do require this, we neatly avoid these objections while also managing to demonstrate desirable connections of logicality to necessity. The resulting view is more adequate as a demarcation of the logical expressions of natural language. (shrink)

This paper consider Prior's connective Tonk from a particular bilateralist perspective. I show that there is a natural perspective from which we can see Tonk and its ilk as perfectly well-defined pieces of vocabulary; there is no need for restrictions to bar things like Tonk.

This self-contained lecture examines uses and misuses of the adverb conversely with special attention to logic and logic-related fields. Sometimes adding conversely after a conjunction such as and signals redundantly that a converse of what preceded will follow. -/- (1) Tarski read Church and, conversely, Church read Tarski. -/- In such cases, conversely serves as an extrapropositional constituent of the sentence in which it occurs: deleting conversely doesn’t change the proposition expressed. Nevertheless it does introduce new implicatures: a speaker would (...) implicate belief that the second sentence expresses a converse of what the first expresses. Perhaps because such usage is familiar, the word conversely can be used as “sentential pronoun”—or prosentence—representing a sentence expressing a converse of what the preceding sentence expresses. -/- (2) Tarski read Church and conversely. -/- This would be understood as expressing the proposition expressed by (1). Prosentential usage introduces ambiguity when the initial proposition has more than one converse. Confusion can occur if the initial proposition has non-equivalent converses. -/- Every proposition that is the negation of a false proposition is true and conversely. -/- One sense implies that every proposition that is the negation of a true proposition is false, which is true of course. But another sense, probably more likely, implies that every proposition that is true is the negation of a false proposition, which is false: the proposition that one precedes two is not a negation and thus is not the negation of a false proposition. The above also applies to synonyms of conversely such as vice versa. Although prosentence has no synonym, extrapropositional constituents are sometimes called redundant rhetoric, filler, or expletive. Authors discussed include Aristotle, Boole, De Morgan, Peirce, Frege, Russell, Tarski, and Church. END OF PUBLISHED ABSTRACT -/- See also: Corcoran, John. 2015. Converses, inner and outer. 2015. Cambridge Dictionary of Philosophy, third edition, Robert Audi (editor). Cambridge: Cambridge UP. https://www.academia.edu/10396347/Corcoran_s_27_entries_in_the_1999_second_edition_Audi_s_Cambridge_ Dictionary_of_Philosophy . (shrink)

Logic, Logical connectives, Verbal disputes, Proof theory, Non-classical logic.

No existing conditional semantics captures the dual role of 'if' in embedded interrogatives — 'X wonders if p' — and conditionals. This paper presses the importance and extent of this challenge, linking it to cross-linguistic patterns and other phenomena involving conditionals. Among these other phenomena are conditionals with multiple 'if'-clauses in the antecedent — 'if p and if q, then r' — and relevance conditionals — 'if you are hungry, there is food in the cupboard'. Both phenomena are shown to (...) be problematic for existing analyses. Surprisingly, the decomposition of conditionals needed to capture the link with interrogatives provides a new analysis that captures all three phenomena. The model-theoretic semantics offered here relies on a dynamic conception of meaning and compositionality, a feature discussed throughout. (shrink)

In this paper we show that there are various pseudo-jump operators definable over inadmissible $J_{\beta}$ that relate to the failure of admissiblity and to non-regularity. We will use these ideas to construct some intermediate degrees.

This paper attempts to motivate the view that instead of rejecting modus ponens as invalid in certain situations, one could preserve its validity by associating such situations with non-normal interpretations of logical connectives.

We present an extension of the mosaic method aimed at capturing many-dimensional modal logics. As a proof-of-concept, we define the method for logics arising from the combination of linear tense operators with an “orthogonal” S5-like modality. We show that the existence of a model for a given set of formulas is equivalent to the existence of a suitable set of partial models, called mosaics, and apply the technique not only in obtaining a proof of decidability and a proof of completeness (...) for the corresponding Hilbert-style axiomatization, but also in the development of a mosaic-based tableau system. We further consider extensions for dealing with the case when interactions between the two dimensions exist, thus covering a wide class of bundled Ockhamist branching-time logics, and present for them some partial results, such as a non-analytic version of the tableau system. (shrink)

In 1926, Ernst Mally, an Austrian logician, has introduced a system of deontic logic in which he has proposed three fundamental distinctions which proved to be important in the context of the further development of the logic of norms. It is argued that in his philosophical considerations Mally has introduced a number of important distinctions concerning the very concept of norm, but by getting them confused in introducing the subsequent formalisms he failed to formally preserve them. In some of his (...) philosophically made distinctions Mally apparently foresaw contemporary trends in logic of norms. To some extent this particular feature of Mally’s system open wide opportunities to reconstruct –– with the corresponding renovations — his illformed Deontik into many nowadays known systems of logic of norms and thus provides a fertile ground for this kind of research. (shrink)

Contemporary orthodoxy affirms that singular terms cannot be predicates and that, therefore, ‘is’ is ambiguous as between predication and identity. Recent attempts to treat names as predicates do not challenge this orthodoxy. The orthodoxy was built into the structure of modern formal logic by Frege. It is defended by arguments which I show to be unsound. I provide a semantical account of atomic sentences which draws upon Mill's account of predication, connotation and denotation. I show that singular terms may be (...) predicates, that it is highly implausible that there is an ‘is’ of identity in natural languages, and that modern formal logic is deficient in that it cannot recognize sentences, including singular existentials, in which singular terms are predicates, or inferences which depend upon the logical role rather than the logical category of expressions. (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)

The aim of this paper is to clarify the truth-functional interpretation of the logical connective of the material implication. The importance of such clarification lies in the fact that it allows avoiding the supposed paradoxes introduced by C. I. Lewis (1918). I argue that an adequate understanding of the history and purposes of logic is enough to dissolve them away. The defense is based on an exposition of propositional compositionalism. To compare, I also present Stalnaker’s (1968) alternative that seeks to (...) explain the implicit concept of conditionality of conditionals assertions. In order to reinforce my aim I expound the twelve different meanings of ‘implication’ stated by Corcoran (1993) in order to hold that a proper understanding of these meanings allows us to avoid ambiguities and confusions. Finally, I expect to show that despite the possible alternatives, compositionalism is still the best explanation for the truth-functionality account of logical connectives. (shrink)

Fara and Williamson (Mind, 2005) argue that counterpart theory is unable to account for modal claims that use an actuality operator. This paper argues otherwise. Rather than provide a different counterpart translation of the actuality operator itself, the solution presented here starts out with a quantified modal logic in which the actuality operator is redundant, and then translates the sentences of this logic into claims of counterpart theory.

In this paper we shall introduce the variety FWHA of frontal weak Heyting algebras as a generalization of the frontal Heyting algebras introduced by Leo Esakia in [ 10 ]. A frontal operator in a weak Heyting algebra A is an expansive operator τ preserving finite meets which also satisfies the equation $${\tau(a) \leq b \vee (b \rightarrow a)}$$, for all $${a, b \in A}$$. These operators were studied from an algebraic, logical and topological point of view by Leo Esakia (...) in [ 10 ]. We will study frontal operators in weak Heyting algebras and we will consider two examples of them. We will give a Priestley duality for the category of frontal weak Heyting algebras in terms of relational spaces $${\langle X, \leq, T, R \rangle}$$ where $${\langle X, \leq, T \rangle}$$ is a WH -space [ 6 ], and R is an additional binary relation used to interpret the modal operator. We will also study the WH -algebras with successor and the WH -algebras with gamma. For these varieties we will give two topological dualities. The first one is based on the representation given for the frontal weak Heyting algebras. The second one is based on certain particular classes of WH -spaces. (shrink)

Let H be an infinite-dimensional (real or complex) Hilbert space, viewed as a metric structure in its natural signature. We characterize the definable linear operators on H as exactly the "scalar plus compact" operators.

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

I show that the model-theoretic meaning that can be read off the natural deduction rules for disjunction fails to have certain desirable properties. I use this result to argue against a modest form of inferentialism which uses natural deduction rules to fix model-theoretic truth-conditions for logical connectives.

Strawson offers three accounts of singular predication: a grammatical, a category and a mediating account. I argue that the grammatical and mediating accounts are refuted by a host of counter-examples and that the latter is worse than useless. In later works Strawson defends only the category account. This account entails that singular terms cannot be predicates; it excludes non-denoting singular terms from being logical subjects, except by means of an ad hoc analogy; it depends upon a notion of identification that (...) is too vague; and it is unnecessarily complicated, relying on analogies where a more uniform explanation should be possible. But I show how the account can be corrected to avoid all these difficulties and to provide an accurate account of singular predication. (shrink)

It will be an essential resource for philosophers, mathematicians, computer scientists, linguists, or any scholar who finds connectives, and the conceptual issues surrounding them, to be a source of interest.This landmark work offers both ...

The interplay of introduction and elimination rules for propositional connectives is often seen as suggesting a distinguished role for intuitionistic logic. We prove three formal results concerning intuitionistic propositional logic that bear on that perspective, and discuss their significance. First, for a range of connectives including both negation and the falsum, there are no classically or intuitionistically correct introduction rules. Second, irrespective of the choice of negation or the falsum as a primitive connective, classical and intuitionistic consequence satisfy exactly the (...) same structural, introduction, and elimination (briefly, elementary) rules. Third, for falsum as primitive only, intuitionistic consequence is the least consequence relation that satisfies all classically correct elementary rules. (shrink)

The logic TK was introduced as a propositional logic extending the classical propositional calculus with a new unary operator which interprets some conceptions of Tarski’s consequence operator. TK-algebras were introduced as models to TK . Thus, by using algebraic tools, the adequacy (soundness and completeness) of TK relatively to the TK-algebras was proved. This work presents a neighbourhood semantics for TK , which turns out to be deductively equivalent to the non-normal modal logic EMT4 . DOI:10.5007/1808-1711.2011v15n2p287.

According to the Ramsey Test, conditionals reflect changes of beliefs: α > β is accepted in a belief state iff β is accepted in the minimal revision of it that is necessary to accommodate α. Since Gärdenfors’s seminal paper of 1986, a series of impossibility theorems (“triviality theorems”) has seemed to show that the Ramsey test is not a viable analysis of conditionals if it is combined with AGM-type belief revision models. I argue that it is possible to endorse that (...) Ramsey test for conditionals while staying true to the spirit of AGM. A main focus lies on AGM’s condition of Preservation according to which the original belief set should be fully retained after a revision by information that is consistent with it. I use concrete representations of belief states and (iterated) revisions of belief states as semantic models for (nested) conditionals. Among the four most natural qualitative models for iterated belief change, two are identified that indeed allow us to combine the Ramsey test with Preservation in the language containing only flat conditionals of the form α > β. It is shown, however, that Preservation for this simple language enforces a violation of Preservation for nested conditionals of the form α > (β > γ). In such languages, no two belief sets are ordered by strict subset inclusion. I argue that it has been wrong right from the start to expect that Preservation holds in languages containing nested conditionals. (shrink)

The theory of imperatives is philosophically relevant since in building it — some of the long standing problems need to be addressed, and presumably some new ones are waiting to be discovered. The relevance of the theory of imperatives for philosophical research is remarkable, but usually recognized only within the field of practical philosophy. Nevertheless, the emphasis can be put on problems of theoretical philosophy. Proper understanding of imperatives is likely to raise doubts about some of our deeply entrenched and (...) tacit presumptions. In philosophy of language it is the presumption that declaratives provide the paradigm for sentence form; in philosophy of science it is the belief that theory construction is independent from the language practice, in logic it is the conviction that logical meaning relations are constituted out of logical terminology, in ontology it is the view that language use is free from ontological commitments. The list is not exhaustive; it includes only those presumptions that this paper concerns. (shrink)

Since the very begining of quantum theory there started a debate on the proper role of space and time in it. Some authors assumed that space and time have their own algebraic operators. On that basis they supposed that quantum particles had “coordinates of position”, even though those coordinates were not possible to determine with infinite precision. Furthermore, time in quantum physics was taken to be on an equal foot, by means of a so-called “Heisenberg’s fourth relation of indeterminacy” concerning (...) time and energy. In this paper, the proper role of space and time in the core of non-relativistic quantum phsysics is analyzed. We will find that, rigorously, that relation for time and energy shows a different root. For the role of space, it will be discussed that there is no “coordinate of position” in the conceptual structure of quantum physics because quantum particles are not point-like objects. DOI:10.5007/1808-1711.2010v14n2p241. (shrink)

We briefly overview some of the historical landmarks on the path leading to the reduction of the number of logical connectives in classical logic. Relying on the duality inherent in Boolean algebras, we introduce a new operator ( Nallor ) that is the dual of Schönfinkel’s operator. We outline the proof that this operator by itself is sufficient to define all the connectives and operators of classical first-order logic ( Fol ). Having scrutinized the proof, we pinpoint the theorems of (...) Fol that are needed in the proof. Using the insights gained from the proof, we show that there are four binary operators that each can serve as the only undefined logical constant for Fol . Finally, we show that from every n -ary connective that yields a functionally complete singleton set of connectives two Schönfinkel-type operators are definable, and all the latter are so definable. (shrink)

(No abstract is available for this citation).

Tarski apresentou sua definição de operador de consequência com a intenção de expor as concepções fundamentais da consequência lógica. Um espaço de Tarski é um par ordenado determinado por um conjunto não vazio e um operador de consequência sobre este conjunto. Esta estrutura matemática caracteriza um espaço quase topológico. Este artigo mostra uma visão algébrica dos espaços de Tarski e introduz uma lógica proposicional modal que interpreta o seu operador modal nos conjuntos fechados de algum espaço de Tarski. DOI:10.5007/1808-1711.2010v14n1p47.

This article has one aim, to reject the claim that negation is semantically ambiguous. The first section presents the putative incompatibility between truth-value gaps and the truth-schema; the second section presents the motivation for the ambiguity thesis; the third section summarizes arguments against the claim that natural language negation is semantically ambiguous; and the fourth section indicates the problems of an introduction of two distinct negation operators in natural language.

In this essay I give a complete join semi-lattice of possible display-equivalence schemes for Display Logic, using the standard connectives, and leaving fixed only the schemes governing the star. In addition to proving the completeness of this list, I offer a discussion of the basic properties of these schemes.

This paper sets forth a new theory of quantifiers and term connectives, called shadow theory , which should help simplify various semantic theories of natural language by greatly reducing the need of Montagovian proper names, type-shifting, and λ-conversion. According to shadow theory, conjunctive, disjunctive, and negative noun phrases such as John and Mary , John or Mary , and not both John and Mary , as well as determiner phrases such as every man , some woman , and the boys (...) , are all of semantic type e and denote individual-like objects, called shadows — conjunctive , disjunctive , or negative shadows, such as John-and-Mary, John-or-Mary, and not-(John-and-Mary). There is no essential difference between quantification and denotation: quantification is nothing but denotation of shadows. Individuals and shadows constitute a Boolean structure. Formal language LSD (Language for Shadows with Distributivity), which takes compound terms to denote shadows, is investigated. Expansions and enrichments of LSD are also considered toward the end of the paper. (shrink)

Towards NonBeing (Priest, 2005) gives a noneist account of the semantics of intentional operators and predicates. The semantics for intentional operators are modelled on those for the , is given and assessed.

Polarized unification grammar (PUG) is a linguistic formalism which uses polarities to better control the way grammar fragments interact. The grammar combination operation of PUG was conjectured to be associative. We show that PUG grammar combination is not associative, and even attaching polarities to objects does not make it order-independent. Moreover, we prove that no non-trivial polarity system exists for which grammar combination is associative. We then redefine the grammar combination operator, moving to the powerset domain, in a way that (...) guarantees associativity. The method we propose is general and is applicable to a variety of tree-based grammar formalisms. (shrink)

Specified meet contraction is the operation defined by the identity where ∼ is full meet contraction and f is a sentential selector, a function from sentences to sentences. With suitable conditions on the sentential selector, specified meet contraction coincides with the partial meet contractions that yield a finite-based contraction outcome if the original belief set is finite-based. In terms of cognitive realism, specified meet contraction has an advantage over partial meet contraction in that the selection mechanism operates on sentences rather (...) than on temporary infinite structures (remainders) that are cognitively inaccessible. Specified meet contraction provides a versatile framework in which other types of contraction, such as severe withdrawal and base-generated contraction, can be expressed with suitably chosen properties of the sentential selector. (shrink)