We present an axiomatization for Basic Propositional Calculus BPC and give a completeness theorem for the class of transitive Kripke structures. We present several refinements, including a completeness theorem for irreflexive trees. The class of intermediate logics includes two maximal nodes, one being Classical Propositional Calculus CPC, the other being E1, a theory axiomatized by T → ⊥. The intersection CPC ∩ E1 is axiomatizable by the Principle of the Excluded Middle A V ∨ ⌝A. If B (...) is a formula such that → B is not derivable, then the lattice of formulas built from one propositional variable p using only the binary connectives, is isomorphically preserved if B is substituted for p. A formula → B is derivable exactly when B is provably equivalent to a formula of the form → A) →. (shrink)

We study the linear Lindenbaum algebra of Basic Propositional Calculus, called linear basic algebra.

We introduce two Gentzen-style sequent calculus axiomatizations for conservative extensions of basic propositional logic. Our first axiomatization is an ipmrovement of, in the sense that it has a kind of the subformula property and is a slight modification of. In this system the cut rule is eliminated. The second axiomatization is a classical conservative extension of basic propositional logic. Using these axiomatizations, we prove interpolation theorems for basic propositional logic.

In this paper we prove a bounded translation of intuitionistic propositional logic into basic propositional logic. Our new theorem, compared with the translation theorem in [1], has the advantage that it gives an effective bound on the translation, depending on the complexity of formulas.

Let ℒ and ? be propositional languages over Basic Propositional Calculus, and ℳ = ℒ∩?. Weprove two different but interrelated interpolation theorems. First, suppose that Π is a sequent theory over ℒ, and Σ∪ {C⇒C′} is a set of sequents over ?, such that Π,Σ⊢C⇒C′. Then there is a sequent theory Φ over ℳ such that Π⊢Φ and Φ, Σ⊢C⇒C′. Second, let A be a formula over ℒ, and C 1, C 2 be formulas over ?, such (...) that A∧C 1⊢C 2. Then there exists a formula B over ℳ such that A⊢B and B∧C 1⊢C 2. (shrink)

This book presents an up-to-date, unified treatment of research in bounded arithmetic and complexity of propositional logic, with emphasis on independence proofs and lower bound proofs. The author discusses the deep connections between logic and complexity theory and lists a number of intriguing open problems. An introduction to the basics of logic and complexity theory is followed by discussion of important results in propositional proof systems and systems of bounded arithmetic. More advanced topics are then (...) treated, including polynomial simulations and conservativity results, various witnessing theorems, the translation of bounded formulas (and their proofs) into propositional ones, the method of random partial restrictions and its applications, direct independence proofs, complete systems of partial relations, lower bounds to the size of constant-depth propositional proofs, the method of Boolean valuations, the issue of hard tautologies and optimal proof systems, combinatorics and complexity theory within bounded arithmetic, and relations to complexity issues of predicate calculus. Students and researchers in mathematical logic and complexity theory will find this comprehensive treatment an excellent guide to this expanding interdisciplinary area. (shrink)

In this paper by using a model-theoretic approach, we prove Craig interpolation property for Formal Propositional Logic, FPL, Basic propositional logic, BPL and the uniform left-interpolation property for FPL. We also show that there are countably infinite extensions of FPL with the uniform interpolation property.

This paper is about sentences of form To be human is to be an animal, To live is to fight, etc. I call them ‘infinitive sentences’. I define an augmented propositional language able to express them and give a matrix-based semantics for it. I also give a tableau proof system, called IL for Infinitive Logic. I prove soundness, completeness and a few basic theorems.

Prawitz proposed certain notions of proof-theoretic validity and conjectured that intuitionistic logic is complete for them [11, 12]. Considering propositional logic, we present a general framework of five abstract conditions which any proof-theoretic semantics should obey. Then we formulate several more specific conditions under which the intuitionistic propositional calculus turns out to be semantically incomplete. Here a crucial role is played by the generalized disjunction principle. Turning to concrete semantics, we show that prominent proposals, including Prawitz’s, (...) satisfy at least one of these conditions, thus rendering IPC semantically incomplete for them. Only for Goldfarb’s [1] proof-theoretic semantics, which deviates from standard approaches, IPC turns out to be complete. Overall, these results show that basic ideas of proof-theoretic semantics for propositional logic are not captured by IPC. (shrink)

We introduce a Gentzen style formulation of Basic Propositional Calculus(BPC), the logic that is interpreted in Kripke models similarly tointuitionistic logic except that the accessibility relation of eachmodel is not necessarily reflexive. The formulation is presented as adual-context style system, in which the left hand side of a sequent isdivided into two parts. Giving an interpretation of the sequents inKripke models, we show the soundness and completeness of the system withrespect to the class of Kripke models. (...) The cut-elimination theorem isproved in a syntactic way by modifying Gentzen's method. Thisdual-context style system exemplifies the effectiveness of dual-contextformulation in formalizing various non-classical logics. (shrink)

Two cut-free sequent calculi which are conservative extensions of Visser's Formal Propositional Logic are introduced. These satisfy a kind of subformula property and by this property the interpolation theorem for FPL are proved. These are analogies to Aghaei-Ardeshir's calculi for Visser's Basic Propositional Logic.

We present an axiom system for basic hybrid logic extended with propositional quantifiers (a second-order extension of basic hybrid logic) and prove its (basic and pure) strong completeness with respect to general models.

Deductive inference is usually regarded as being “tautological” or “analytical”: the information conveyed by the conclusion is contained in the information conveyed by the premises. This idea, however, clashes with the undecidability of first-order logic and with the (likely) intractability of Boolean logic. In this article, we address the problem both from the semantic and the proof-theoretical point of view. We propose a hierarchy of propositional logics that are all tractable (i.e. decidable in polynomial time), although by (...) means of growing computational resources, and converge towards classical propositional logic. The underlying claim is that this hierarchy can be used to represent increasing levels of “depth” or “informativeness” of Boolean reasoning. Special attention is paid to the most basic logic in this hierarchy, the pure “intelim logic”, which satisfies all the requirements of a natural deduction system (allowing both introduction and elimination rules for each logical operator) while admitting of a feasible (quadratic) decision procedure. We argue that this logic is “analytic” in a particularly strict sense, in that it rules out any use of “virtual information”, which is chiefly responsible for the combinatorial explosion of standard classical systems. As a result, analyticity and tractability are reconciled and growing degrees of computational complexity are associated with the depth at which the use of virtual information is allowed. (shrink)

This paper introduces sequent systems for Visser's two propositional logics: Basic Propositional Logic (BPL) and Formal Propositional Logic (FPL). It is shown through semantical completeness that the cut rule is admissible in each system. The relationships with Hilbert-style axiomatizations and with other sequent formulations are discussed. The cut-elimination theorems are also demonstrated by syntactical methods.

In the paper, we apply Kooi and Tamminga’s correspondence analysis to some conventional and functionally incomplete fragments of classical propositional logic. In particular, the paper deals with the implication, disjunction, and negation fragments. Additionally, we consider an application of correspondence analysis to some connectiveless fragment with certain basic properties of the logical consequence relation only. As a result of the application, one obtains a sound and complete natural deduction system for any binary extension of each fragment in (...) question. With the focus on exclusive disjunction we comparatively study the proposed systems. Finally, we discuss Segerberg’s systems for connectiveless and negation fragments and compare them with our systems. (shrink)

Peter Hanks defends a new theory about the nature of propositional content, according to which the basic bearers of representational properties are particular mental or spoken actions. He explains the unity of propositions and provides new solutions to a long list of puzzles and problems in philosophy of language.

A common misconception among logicians is to think that intuitionism is necessarily tied-up with single conclusion calculi. Single conclusion calculi can be used to model intuitionism and they are convenient, but by no means are they necessary. This has been shown by such influential textbook authors as Kleene, Takeuti and Dummett, to cite only three. If single conclusions are not necessary, how do we guarantee that only intuitionistic derivations are allowed? Traditionally one insists on restrictions on particular rules: implication right, (...) negation right and universal quantification right are required to be single conclusion rules. In this note we show that instead of a cardinality restriction such as one-conclusion-only, we can use a notion of dependency between formulae to enforce the constructive character of derivations. The system we obtain, called FIL for full intuitionistic logic, satisfies basic properties such as soundness, completeness and cut elimination. We present two motivating applications of FIL and discuss some future work. (shrink)

Cirquent calculus is a proof system with inherent ability to account for sharing subcomponents in logical expressions. Within its framework, this article constructs an axiomatization $$\text{ CL18 }$$ CL18 of the basic propositional fragment of computability logic—the game-semantically conceived logic of computational resources and tasks. The nonlogical atoms of this fragment represent arbitrary so called static games, and the connectives of its logical vocabulary are negation and the parallel and choice versions of conjunction and disjunction. The (...) main technical result of the article is a proof of the soundness and completeness of $$\text{ CL18 }$$ CL18 with respect to the semantics of computability logic. (shrink)

In this paper is constructed an analogue of the square of opposition for propositions about relations between two non-empty sets. Unlike the classical square of opposition, the proposed scheme uses all logically possible syllogistic constants, formulated in V.I. Markin’s universal language for traditional positive syllogistic theories. This scheme can be called “Logical lantern”. The basic constants of this language are representing the five basic relations between two non-empty sets: equity, strict inclusion, reversed strict inclusion, intersection and exclusion (considered (...) are only the relations between sets, but not the relations of the sets to the universe). The other relations between sets are combinations (disjunctions) of the basic ones. There are 32 constants and 32 respective propositions, and the proposed diagram expresses and/or allows to deduce the logical relations among those propositions. The constructed scheme, making it possible to visually see the logical relations among propositions about relations between two non-empty sets, allows us to suggest considering logical relations not discussed previously: many-place Aristotelian-like logical relations among propositions: exhaustive _n_-place contrariety and exhaustive _n_-place subcontrariety (_n_ is a natural number, $$n>2$$). (shrink)

We investigate and classify the notion of final derivability of two basic inconsistency-adaptive logics. Specifically, the maximal complexity of the set of final consequences of decidable sets of premises formulated in the language of propositional logic is described. Our results show that taking the consequences of a decidable propositional theory is a complicated operation. The set of final consequences according to either the Reliability Calculus or the Minimal Abnormality Calculus of a decidable propositional premise set (...) is in general undecidable, and can be -complete. These classifications are exact. For first order theories even finite sets of premises can generate such consequence sets in either calculus. (shrink)

Jeffrey King, Scott Soames, and others have recently challenged the familiar identification of a Russellian proposition, such as the proposition that Brutus stabbed Caesar, with an ordered sequence constructed out of objects, properties, and relations. There is, as they point out, a surplus of candidate sequences available that are each equally serviceable. If so, any choice among these candidates will be arbitrary. In this paper, I show that, unless a controversial assumption is made regarding the nature of nonsymmetrical relations, none (...) of the proffered candidate sequences are in fact adequate to the play the role. Moreover, as I argue, the most promising alternative theory of relations—one that avoids the problematic assumption and, in addition, fits most naturally into the sequentialist’s framework—fails to meet a basic requirement: it cannot distinguish between the proposition that Brutus stabbed Caesar and the proposition that Caesar stabbed Brutus. The upshot is that the conspicuously structured entities that are widely assumed to be up to the task of “playing the proposition role” shed no light on the very structure they are invoked to represent. (shrink)

The author puts forth an approach to propositional attitude contexts based upon the view that one does not have beliefs of ordinary extensional entitiessimpliciter. Rather, one has beliefs of such entities as presented in various manners. Roughly, these are treated as beliefs of ordered pairs — the first member of which is the ordinary extensional entity and the second member of which is a predicate that it satisfies. Such an approach has no difficulties with problems involving identity, such as (...) of The Morning Star and The Evening Star (section 1). Given the second members of the pairs, the modes of presentation, it is quite natural to allow exportation everywhere. There is no need for essentialism. (One also can have non-essentialistic modal logic if one grants analyticity or the like.) (section 2). Given that the second member of the pair need only be one that is satisfied by the entity that is the first member (and need not be specificative), the method has no difficulties when one is concerned only with discriminations (and not specifications) (section 3). When this method is combined with the Frege-Carnap method of descriptions, fictional entities can be accommodated; Goodman''s unicorn-picture and the like can be brought within a Tarskian semantics; and Geach''s difficulties with intentional identity appear to be handled (section 4). Given the author''s ordered pair construals, there appears to be no additional need for notional construals; i.e., the author''s one unified method appears satisfactory for dealing with both traditionalde re (relational) andde dicto (notional) construals. The Paradox of the Knower and the like do not appear formulatable against the author''s approach. (section 5). The author also argues against the basic principles behind the Church-Langford translation argument (section 6). (shrink)

Using the theory of BL-algebras, it is shown that a propositional formula ϕ is derivable in Łukasiewicz infinite valued Logic if and only if its double negation ˜˜ϕ is derivable in Hájek Basic Fuzzy logic. If SBL is the extension of Basic Logic by the axiom (φ & (φ→˜φ)) → ψ, then ϕ is derivable in in classical logic if and only if ˜˜ ϕ is derivable in SBL. Axiomatic extensions of Basic (...) Logic are in correspondence with subvarieties of the variety of BL-algebras. It is shown that the MV-algebra of regular elements of a free algebra in a subvariety of BL-algebras is free in the corresponding subvariety of MV-algebras, with the same number of free generators. Similar results are obtained for the generalized BL-algebras of dense elements of free BL-algebras. (shrink)

Propositions are more than the bearers of truth and the meanings of sentences: they are also the objects of an array of attitudes including belief, desire, hope, and fear. This variety of roles leads to a variety of paradoxes, most of which have been sorely neglected. Arguing that existing work on these paradoxes is either too heavy-handed or too specific in its focus to be fully satisfactory, I develop a basic intensional logic and pursue and compare three strategies (...) for addressing the paradoxes, one employing truth-value gaps, one restricting propositional quantification, and one restricting our ability to have attitudes like belief and desire. This results in four distinct resolutions of the paradoxes, all but one of which are novel and all of which receive novel and general implementations. While resolving the paradoxes is of course the ultimate goal, I do not here argue that any one of the resolutions is superior. These paradoxes have been so little studied that my primary goal is only to identify the most fundamental costs and benefits of the various approaches one can take to addressing them. Each resolution I develop has significant drawbacks, which I argue highlight tensions between the different roles propositions play. Past researchers have skirted these tensions, and the issues raised by these paradoxes more generally, by focusing on non-propositional paradoxes, such as the most familiar forms of the Liar paradox. At the least, then, I hope this dissertation establishes that the propositional paradoxes deserve attention not only because of their consequences for intensional logic, but also because of their consequences for our understanding of content, truth, quantification, and a host of mental attitudes. (shrink)

We consider second-order propositional modal logic (SOPML), an extension of the basic modal language with propositional quantifiers introduced by Kit Fine in 1970. We determine the precise expressive power of SOPML by giving analogues of the Van Benthem–Rosen theorem and the Goldblatt Thomason theorem. Furthermore, we show that the basic modal language is the bisimulation invariant fragment of SOPML, and we characterize the bounded fragment of first-order logic as being the intersection of first-order (...) class='Hi'>logic and SOPML. (shrink)

The logic BKc1 is the basic constructive logic for weak consistency in the ternary relational semantics without a set of designated points. In this paper, a number of extensions of B Kc1 defined with a propositional falsity constant are defined. It is also proved that weak consistency is not equivalent to negation-consistency or absolute consistency in any logic included in positive contractionless intermediate logic LC plus the constructive negation of BKc1 and the contraposition axioms.

This talk shows how propositional dynamic logic (PDL) can be interpreted as a logic for multi-agent knowledge update and belief revision, or as a logic of preference change, if the basic relations are read as preferences instead of plausibilities. Our point of departure is the logic of communication and change (LCC) of [9]. Like LCC, our logic uses PDL as a base epistemic language. Unlike LCC, we start out from agent plausibilities, add their (...) converses, and build knowledge and belief operators from these with the PDL constructs. We extend the update mechanism of LCC to an update mechanism that handles belief change as relation substitution, and we show that the update part of this logic is more expressive than either that of LCC or that of epistemic/doxastic PDL with a belief change modality. Next, we show that the properties of knowledge and belief are preserved under any update, unlike in LCC. We prove completeness of the logic and give examples of its use. If there is time, we will also look at the preference interpretation of the system, and at preference change scenarios that can be modelled with it. (shrink)

This article concerns the treatment of propositional quantification in a framework of labelled natural deduction for modal logic developed by Basin, Matthews and Viganò. We provide a detailed analysis of a basic calculus that can be used for a proof-theoretic rendering of minimal normal multimodal systems with quantification over stable domains of propositions. Furthermore, we consider variations of the basic calculus obtained via relational theories and domain theories allowing for quantification over possibly unstable domains of propositions. (...) The main result of the article is that fragments of the labelled calculi not exploiting reductio ad absurdum enjoy the Church–Rosser property and the strong normalization property; such result is obtained by combining Girard’s method of reducibility candidates and labelled languages of lambda calculus codifying the structure of modal proofs. (shrink)

"A valuable collection both for original source material as well as historical formulations of current problems."-- The Review of Metaphysics "Much more than a mere collection of papers . . . a valuable addition to the literature."-- Mathematics of Computation An anthology of fundamental papers on undecidability and unsolvability by major figures in the field, this classic reference opens with Godel's landmark 1931 paper demonstrating that systems of logic cannot admit proofs of all true assertions of arithmetic. Subsequent papers (...) by Godel, Church, Turing, and Post single out the class of recursive functions as computable by finite algorithms. Additional papers by Church, Turing, and Post cover unsolvable problems from the theory of abstract computing machines, mathematical logic, and algebra, and material by Kleene and Post includes initiation of the classification theory of unsolvable problems. Suitable for graduate and undergraduate courses. 1965 ed. (shrink)

Topic of the paper is Q-logic – a logic of agency in its temporal and modal context. Q-logic may be considered as a basal logic of agency since the most important stit-operators discussed in the literature can be defined or axiomatized easily within its semantical and syntactical framework. Its basic agent dependent operator, the Q-operator (also known as Δ- or cstit-operator), which has been discussed independently by F. v. Kutschera and B. F. Chellas, is investigated (...) here in respect of its relation to other temporal and modal operators. The main result of the paper, then, is a completeness result for a calculus of Q-logic with respect to a semantics defined on the tree-approach to agency as introduced and developed by, among others, F. v. Kutschera and N. D. Belnap. (shrink)

In sections 1 through 5, I develop in detail what I call the standard theory of worlds and propositions, and I discuss a number of purported objections. The theory consists of five theses. The first two theses, presented in section 1, assert that the propositions form a Boolean algebra with respect to implication, and that the algebra is complete, respectively. In section 2, I introduce the notion of logical space: it is a field of sets that represents the propositional (...) structure and whose space consists of all and only the worlds. The next three theses, presented in sections 3, 4, and 5, respectively, guarantee the existence of logical space, and further constrain its structure. The third thesis asserts that the set of propositions true at any world is maximal consistent; the fourth thesis that any two worlds are separated by a proposition; the fifth thesis that only one proposition is false at every world. In sections 6 through 10, I turn to the problem of reduction. In sections 6 and 7, I show how the standard theory can be used to support either a reduction of worlds to propositions or a reduction of propositions to worlds. A number of proposition-based theories are developed in section 6, and compared with Adams's world-story theory. A world-based theory is developed in section?, and Stalnaker's account of the matter is discussed. Before passing judgment on the proposition based and world-based theories, I ask in sections 8 and 9 whether both worlds and propositions might be reduced to something else. In section 8, I consider reductions to linguistic entities; in section 9, reductions to unfounded sets. After rejecting the possibility of eliminating both worlds and propositions, I return in section 10 to the possibility of eliminating one in favor of the other. I conclude, somewhat tentatively, that neither worlds nor propositions should be reduced one to the other, that both worlds and propositions should be taken as basic to our ontology. (shrink)

We consider second-order propositional modal logic (SOPML), an extension of the basic modal language with propositional quantifiers introduced by Kit Fine in 1970. We determine the precise expressive power of SOPML by giving analogues of the Van Benthem–Rosen theorem and the Goldblatt Thomason theorem. Furthermore, we show that the basic modal language is the bisimulation invariant fragment of SOPML, and we characterize the bounded fragment of first-order logic as being the intersection of first-order (...) class='Hi'>logic and SOPML. (shrink)

As anyone who is familiar with the literature knows, there is a great deal of controversy concerning which, if any, of the extant theories of propositional modal logic correctly formalizes the logic of certain logical concepts such as analyticity and logical necessity. Most of the controversy concerns certain principles that involve iterated modalities (where one modal operator occurs within the scope of another). For example, there is considerable disagreement about whether the principle(□p⊃□□p)should be considered valid. However, when (...) philosophers and logiciansapplymodal logic to concrete problems, they rarely need principles which involve iterated modalities. For most practical purposes, principles involving only one layer of modalities are all that are needed. This suggests that if we try to construct a theory of modal logic in which there are no iterated modalities, we can avoid most of the controversy and still have a theory that is strong enough for all of the normal uses to which modal logic is put. (shrink)

Topic of the paper is Q-logic - a logic of agency in its temporal and modal context. Q-logic may be considered as a basal logic of agency since the most important stitoperators discussed in the literature can be defined or axiomatized easily within its semantical and syntactical framework. Its basic agent dependent operator, the Q-operator (also known as Δ- or cstit-operator), which has been discussed independently by E v. Kutschera and B. E Chellas, is investigated (...) here in respect of its relation to other temporal and modal operators. The main result of the paper, then, is a completeness result for a calculus of Q-logic with respect to a semantics defined on the tree-approach to agency as introduced and developed by, among others, E v. Kutschera and N. D. Belnap. (shrink)

The language of the basic logic of proofs extends the usual propositional language by forming sentences of the sort x is a proof of F for any sentence F. In this paper a complete axiomatization for the basic logic of proofs in Heyting Arithmetic HA was found.

In this paper we present a neighborhood semantics for Intuitionistic Propositional Logic (IPL). We show that for each Kripke model of the logic there is a pointwise equivalent neighborhood model and vice versa. In this way, we establish soundness and completeness of IPL with respect to the neighborhood semantics. The relation between neighborhood and topological semantics are also investigated. Moreover, the notions of bisimulation and n-bisimulation between neighborhood models of IPL are defined naturally and some of their (...) basic properties are proved. We also consider Basic Propositional Logic (BPL), a logic weaker than IPL introduced by Albert Visser, and introduce and study its neighborhood models in the same manner. (shrink)

Free-variable semantic tableaux are a well-established technique for first-order theorem proving where free variables act as a meta-linguistic device for tracking the eigenvariables used during proof search. We present the theoretical foundations to extend this technique to propositional modal logics, including non-trivial rigorous proofs of soundness and completeness, and also present various techniques that improve the efficiency of the basic naive method for such tableaux.

The Substitution Anomaly is the failure of intuitively coreferential expressions of the corresponding forms “that S” and “the proposition that S” to be intersubstitutable salva veritate under certain ‘selective’ attitudinal verbs that grammatically accept both sorts of terms as complements. The Substitution Anomaly poses a direct threat to the basic assumptions of Millianism, which predict the interchangeability of “that S” and “the proposition that S”. Jeffrey King has argued persuasively that the most plausible Millian solution is to treat the (...) selective attitudinal verbs as lexically ambiguous , having distinct meanings associated with the different sorts of complement terms. In opposition this approach, I argue that there are independent reasons for maintaining the univocality of these verbs and that this can be done while accommodating the Substitution Anomaly and without sacrificing the transparency of the relevant attitude ascriptions. In particular, I show how, by employing an extended version of Edward Zalta’s system of intensional logic for abstract objects, one can construct for a regimented fragment ℜ of English containing the relevant vocabulary a semantical theory ℑ which (a) treats ℜ’s selective attitudinal verbs as univocal, (b) regards genuine terms as occurring transparently under such verbs in sentences of ℜ, and yet (c) predicts the occurrence of the Substitution Anomaly in ℜ. (shrink)

1. IMPORTANCE OF THE SUBJECT In 1900, in A Critical Exposition of the Philosophy of Leihniz, Russell made the following assertion: "That all sound philosophy should begin with an analysis of propositions is a truth too evident, perhaps, to demand a proof". 1 Forty years later, the interest aroused by this notion had not decreased. C. J. Ducasse wrote in the Journal of Philosophy: "There is perhaps no question more basic for the theory of knowledge than that of the (...) nature of 2 propositions and their relations to judgments, sentences, facts and inferences". Today, the great number of publications on the subject is proof that it is still of interest. One of the problems raised by propositions, the problem of deter mining whether propositions, statements or sentences are the primary bearers of truth and falsity, is even in the eyes of Bar-Hillel, "one of the major items that the future philosophy oflanguage will have to discuss". 3 gave a correct summary of the situation when he wrote in his Ph. Devaux Russell : Since Peano and Schroder who, in fact, adhered more faithfully to Boole's logic of classes, the logical and epistemological status of the proposition together with its analysis have not ceased to be the object of productive philosophical controversies. And especially so since the establishment of contemporary symbolic logic, the foundations 4 of which have been laid out by Russell and Whitehead. * 2. (shrink)

A number of philosophers and logicians have argued for the conclusion that maps are logically tractable modes of representation by analyzing them in propositional terms. But in doing so, they have often left what they mean by "propositional" undefined or unjustified. I argue that propositions are characterized by a structure that is digital, universal, asymmetrical, and recursive. There is little positive evidence that maps exhibit these features. Instead, we can better explain their functional structure by taking seriously the (...) observation that maps arrange their constituent elements in a non-hierarchical, holistic structure. This is compatible with the more basic claim advanced by defenders of a propositional analysis: that (many) maps do have formal semantics and logic. (shrink)

What makes a visually appealing landscape? How can the design and use of a landscape be harmonised? In this significantly revised and updated third edition of Simon Bell's seminal text, he further explores the answers to these questions by interrogating a range of design principles, applications and ideas. Written for students, instructors and professionals, the book unveils a visual design vocabulary for anyone involved with landscape aesthetics including landscape architects, architects, planners, urban designers, landscape managers, foresters, geographers and ecologists. Structured (...) around key design terms, which are explained and illustrated using an extensive range of examples from around the world, including North America, Europe and Asia, this book enables you to describe, debate and design the visual landscape. It starts with basic elements, before moving onto variable design components, and then the ways these elements are organized into compositions, in order to demonstrate how landscapes are created and how meanings and patterns are perceived within them. This new full colour edition contains over 240 images; an updated introduction; examples from China, Vietnam, and central Asia; a chapter on how to read and understand visual design elements in the landscape; a teaching model for instructors; and expanded appendix materials including a glossary, references and further reading. (shrink)

We attempt to define the classical propositional logic by use of appropriate derivability conditions called Cn-definitions. The conditions characterize basic properties of propositional connectives.

The final portion of the thesis surveys proposals for the introduction of hidden variables into quantum mechanics, proofs of the impossibility of such hidden-variable proposals, and criticisms of these impossibility proofs. And arguments in favour of the partial-Boolean algebra, rather than the orthomodular lattice, formalization of the quantum propositional structures are reviewed. ;As for , each quantum state-induced expectation-function on a P truth-functionally assigns 1 and 0 values to the elements in a ultrafilter and dual ultraideal of P, where (...) in general the union of an ultrafilter and its dual ultraideal is smaller than the entire structure. Thus it is argued that each expectation-function is the quantum analog of a classical semantic mapping, even though the domain where each expectation-function is bivalent and truth-functional is usually a non-Boolean substructure of P. ;In classical propositional logic, propositions form a Boolean algebra, and each semantic mapping assigns the value 1 to the members of a certain subset of the algebra, namely, an ultrafilter, and assigns 0 to the members of the dual ultraideal, where the union of these two subsets is the entire algebra. The propositional structures of classical mechanics are likewise Boolean algebras, so one can straightforwardly provide a classical semantics, which also satisfies . However, quantum propositional structures are non-Boolean, so it is an open question whether a semantics satisfying , and can be provided. ;Von Neumann first proposed that the algebraic structures of the subspaces of Hilbert space be regarded as the propositional structures P of quantum mechanics. These structures have been formalized in two ways: as orthomodular lattices which have the binary operations "and", "or", defined among all elements, compatible and incompatible ; and as partial-Boolean algebras which have the binary operations defined among only compatible elements. In the thesis, two basic senses in which these structures are non-Boolean are discriminated. And two notions of truth-functionality are distinguished: truth-functionality ,) applicable to the Plattices; and truth-functionality ) applicable to both the Plattices and partial-Boolean algebras. Then it is shown how the lattice definitions of "and", "or", among incompatibles rule out a bivalent, truth-functional ,) semantics for any PQM lattice containing incompatible elements. In contrast, the Gleason and Kochen-Specker proofs of the impossibility of hidden-variables for quantum mechanics show the impossibility of a bivalent, truth-functional ) semantics for three-or-higher dimensional Hilbert space PQM structures; and the presence of incompatible elements is necessary but is not sufficient to rule out such a semantics. ;The thesis investigates the possibility of a classical semantics for quantum propositional structures. A classical semantics is defined as a set of mappings each of which is bivalent, i.e., the value 1 or 0 is assigned to each proposition, and truth-functional, i.e., the logical operations are preserved. In addition, this set must be "full", i.e., any pair of distinct propositions is assigned different values by some mapping in the set. When the propositions make assertions about the properties of classical or of quantum systems, the mappings should also be "state-induced", i.e., values assigned by the semantics should accord with values assigned by classical or by quantum mechanics. (shrink)

_Logic: The Basics_ is an accessible introduction to several core areas of logic. The first part of the book features a self-contained introduction to the standard topics in classical logic, such as: · mathematical preliminaries · propositional logic · quantified logic · English and standard ‘symbolic translations’ · tableau procedures. Alongside comprehensive coverage of the standard topics, this thoroughly revised second edition also introduces several philosophically important nonclassical logics, free logics, and modal logics, and gives (...) the reader an idea of how they can take their knowledge further. With its wealth of exercises, _Logic: The Basics _is a useful textbook for courses ranging from the introductory level to the early graduate level, and also as a reference for students and researchers in philosophical logic. (shrink)

Can we find propositions that cannot rationally be denied in any possible world without assuming the existence of that same proposition, and so involving ourselves in a contradiction? In other words, can we find transworld propositions needing no further foundation or justification? Basically, three differing positions can be imagined: firstly, a relativist position, according to which ultimately founded propositions are impossible; secondly, a meta-relativist position, according to which ultimately founded propositions are possible but unnecessary; and thirdly, an absolute position, according (...) to which such propositions are necessary. In this short essay I show that under the premise of modal logic S5 with constant domain there are ultimately founded propositions and that their existence is even necessary, and I will give some reasons for the superiority of S5 over other logics. (shrink)

In this note we provide a simple proof of the incompactness over Routley-Meyer B-frames of the A1 fragment of the second order propositional relevant language.

Steinsvold (2020) has provided two semantics for the basic modal language enriched with propositional quantifiers (∀p). We define an extension EM of the system KD45_{\Box} and prove that EM is sound and complete for both semantics. It follows that the two semantics are equivalent.