The orthodoxy on the concept of ownership is given by Honoré's list of incidents. The idea this portrays is as ownership as a very flexible concept. The main purpose of this paper is to argue that the concept of property has much more integrity than the notion of a bundle of incidents may suggest. The Libertarian Challenge claims that redistributive theories of Justice, in so far as they impose involuntary taxes, are inconsistent with property rights, and are therefore (...) unjustifiable. One response to the libertarian challenge is to present alternative conceptions of ownership that are based on less than the complete list of incidents. These conceptions, we are told, avoid the inconsistency inherent in redistributive taxation by rejecting the incidents that are the source of the inconsistency, while retaining the moral appeal by leaving in place the core incidents and thus remaining faithful to what is primarily justifiable in property rights. Such an approach has been taken by several writers (notably, Waldron, Christman, and Fried). These different attempts to present a "truncated", "bifurcated", or "purist" concept of property invariably fail. Taxation must be an infringement of property. The upshot of this is that a justification of redistributive taxation requires a restriction of property or abandoning it altogether rather than redefining it. (shrink)

In this paper, I will argue that there is a version of possibilism—inspired by the modal analogue of Kit Fine’s fragmentalism—that can be combined with a weakening of actualism. The reasons for analysing this view, which I call Modal Fragmentalism, are twofold. Firstly, it can enrich our understanding of the actualism/possibilism divide, by showing that, at least in principle, the adoption of possibilia does not correspond to an outright rejection of the actualist intuitions. Secondly, and more specifically, it can enrich (...) our understanding of concretism, by proving that, at least in principle, the idea that objects have properties in an absolute manner is compatible with transworld identity. (shrink)

We introduce the anti-rectangle refining property for forcing notions and investigate fragments of Martin’s axiom for ℵ1 dense sets related to the anti-rectangle refining property, which is close to some fragment of Martin’s axiom for ℵ1 dense sets related to the rectangle refining property, and prove that they are really weaker fragments.

Recently Lafont [6] showed the finite model property for the multiplicative additive fragment of linear logic (MALL) and for affine logic (LLW), i.e., linear logic with weakening. In this paper, we shall prove the finite model property for intuitionistic versions of those, i.e. intuitionistic MALL (which we call IMALL), and intuitionistic LLW (which we call ILLW). In addition, we shall show the finite model property for contractive linear logic (LLC), i.e., linear logic with contraction, and for its (...) intuitionistic version (ILLC). The finite model property for related substructural logics also follow by our method. In particular, we shall show that the property holds for all of FL and GL - -systems except FL c and GL - c of Ono [11], that will settle the open problems stated in Ono [12]. (shrink)

We introduce a property of forcing notions, called the anti-, which comes from Aronszajn trees. This property canonically defines a new chain condition stronger than the countable chain condition, which is called the property . In this paper, we investigate the property . For example, we show that a forcing notion with the property does not add random reals. We prove that it is consistent that every forcing notion with the property has precaliber 1 (...) and for forcing notions with the property fails. This negatively answers a part of one of the classical problems about implications between fragments of. (shrink)

Recently Lafont [6] showed the finite model property for the multiplicative additive fragment of linear logic and for affine logic, i.e., linear logic with weakening. In this paper, we shall prove the finite model property for intuitionistic versions of those, i.e. intuitionistic MALL, and intuitionistic LLW. In addition, we shall show the finite model property for contractive linear logic, i.e., linear logic with contraction, and for its intuitionistic version. The finite model property for related substructural logics (...) also follow by our method. In particular, we shall show that the property holds for all of FL and GL$^-$-systems except FL$_c$ and GL$^-_c$ of Ono [11], that will settle the open problems stated in Ono [12]. (shrink)

We show that the loosely guarded and packed fragments of first-order logic have the finite model property. We use a construction of Herwig and Hrushovski. We point out some consequences in temporal predicate logic and algebraic logic.

We show that the loosely guarded and packed fragments of first-order logic have the finite model property. We use a construction of Herwig and Hrushovski. We point out some consequences in temporal predicate logic and algebraic logic.

The aim of this paper is to show that the implicational fragment BKof the intuitionistic propositional calculus (IPC) without the rules of exchange and contraction has the finite model property with respect to the quasivariety of left residuation algebras (its equivalent algebraic semantics). It follows that the variety generated by all left residuation algebras is generated by the finite left residuation algebras. We also establish that BKhas the finite model property with respect to a class of structures that (...) constitute a Kripke-style relational semantics for it. The results settle a question of Ono and Komori [OK85]. (shrink)

We study the variety of equivalential algebras with zero and its subquasivariety that gives the equivalent algebraic semantics for the ‐fragment of intuitionistic propositional logic. We prove that this fragment is hereditarily structurally complete. Moreover, we effectively construct the finitely generated free equivalential algebras with zero.

In the paper A non-implication between fragments of Martin’s Axiom related to a property which comes from Aronszajn trees , Proposition 2.7 is not true. To avoid this error and correct Proposition 2.7, the definition of the property is changed. In Yorioka [1], all proofs of lemmas and theorems but Lemma 6.9 are valid about this definition without changing the proofs. We give a new statement and a new proof of Lemma 6.9.

Quasi-Nelson logic (QNL) was recently introduced as a common generalisation of intuitionistic logic and Nelson's constructive logic with strong negation. Viewed as a substructural logic, QNL is the axiomatic extension of the Full Lambek Calculus with Exchange and Weakening by the Nelson axiom, and its algebraic counterpart is a variety of residuated lattices called quasi-Nelson algebras. Nelson's logic, in turn, may be obtained as the axiomatic extension of QNL by the double negation (or involutivity) axiom, and intuitionistic logic as the (...) extension of QNL by the contraction axiom. A recent series of papers by the author and collaborators initiated the study of fragments of QNL, which correspond to subreducts of quasi-Nelson algebras. In the present paper we focus on fragments that contain the connectives forming a residuated pair (the monoid conjunction and the so-called strong Nelson implication), these being the most interesting ones from a substructural logic perspective. We provide quasi-equational (whenever possible, equational) axiomatisations for the corresponding classes of algebras, obtain twist representations for them, study their congruence properties and take a look at a few notable subvarieties. Our results specialise to the involutive case, yielding characterisations of the corresponding fragments of Nelson's logic and their algebraic counterparts. (shrink)

We strengthen a result of Harrington and Shelah by showing that, unless ω1 is an inaccessible cardinal in L, a relatively weak fragment of Martin's axiom implies that there exists a δ13 set of reals without the property of Baire.

This is the second of a series of papers that investigate fragments of quasi-Nelson logic (QNL) from an algebraic logic standpoint. QNL, recently introduced as a common generalization of intuitionistic and Nelson’s constructive logic with strong negation, is the axiomatic extension of the substructural logic |$FL_{ew}$| (full Lambek calculus with exchange and weakening) by the Nelson axiom. The algebraic counterpart of QNL (quasi-Nelson algebras) is a class of commutative integral residuated lattices (a.k.a. |$FL_{ew}$|-algebras) that includes both Heyting and Nelson algebras (...) and can be characterized algebraically in several alternative ways. The present paper focuses on the algebraic counterpart (a class we dub quasi-Nelson implication algebras, QNI-algebras) of the implication–negation fragment of QNL, corresponding to the connectives that witness the algebraizability of QNL. We recall the main known results on QNI-algebras and establish a number of new ones. Among these, we show that QNI-algebras form a congruence-distributive variety (Cor. 3.15) that enjoys equationally definable principal congruences and the strong congruence extension property (Prop. 3.16); we also characterize the subdirectly irreducible QNI-algebras in terms of the underlying poset structure (Thm. 4.23). Most of these results are obtained thanks to twist representations for QNI-algebras, which generalize the known ones for Nelson and quasi-Nelson algebras; we further introduce a Hilbert-style calculus that is algebraizable and has the variety of QNI-algebras as its equivalent algebraic semantics. (shrink)

We establish by elementary proof-theoretic means the conservativeness of two subsystems of analysis over primitive recursive arithmetic. The one subsystem was introduced by Friedman [6], the other is a strengthened version of a theory of Minc [14]; each has been shown to be of considerable interest for both mathematical practice and metamathematical investigations. The foundational significance of such conservation results is clear: they provide a direct finitist justification of the part of mathematical practice formalizable in these subsystems. The results are (...) generalized to relate a hierarchy of subsystems, all contained in the theory of arithmetic properties, to a corresponding hierarchy of fragments of arithmetic. The proof theoretic tools employed there are used to re-establish in a uniform, elementary way relationships between various fragments of arithmetic due to Parsons, Paris and Kirby, and Friedman. (shrink)

Objects often manifest themselves in incompatible ways across perspectives that are epistemically on a par. The standard response to such cases is to deny that the properties that things appear to have from different perspectives are properties that things really have out there. This type of response seems worrying: too many properties admit of perspectival variance and there are good theoretical reasons to think that such properties are genuinely instantiated. So, we have reason to explore views on which things can (...) have the incompatible properties they appear to have across perspectives. This paper explores the view that things can have incompatible properties if the world is not a metaphysically unified place but is instead fragmented. There is a sensible notion of co-obtainment, on which two facts can each obtain without co-obtaining. Using this notion, we can step back from our embedded perspectives on the world without deeming the contents of those perspectives to be mere appearances. This renders th.. (shrink)

We show that large fragments of MM, e. g. the tree property and stationary reflection, are preserved by strongly -game-closed forcings. PFA can be destroyed by a strongly -game-closed forcing but not by an ω2-closed.

By a theorem of R. Kaye, J. Paris and C. Dimitracopoulos, the class of the Πn+1-sentences true in the standard model is the only consistent Πn+1-theory which extends the scheme of induction for parameter free Πn+1-formulas. Motivated by this result, we present a systematic study of extensions of bounded quantifier complexity of fragments of first-order Peano Arithmetic. Here, we improve that result and show that this property describes a general phenomenon valid for parameter free schemes. As a consequence, we (...) obtain results on the quantifier complexity, finite axiomatizability and relative strength of schemes for Δn+1-formulas. (shrink)

What precisely are fragments of classical first-order logic showing “modal” behaviour? Perhaps the most influential answer is that of Gabbay 1981, which identifies them with so-called “finite-variable fragments”, using only some fixed finite number of variables (free or bound). This view-point has been endorsed by many authors (cf. van Benthem 1991). We will investigate these fragments, and find that, illuminating and interesting though they are, they lack the required nice behaviour in our sense. (Several new negative results support this claim.) (...) As a counterproposal, then, we define a large fragment of predicate logic characterized by its use of only bounded quantification. This so-called guarded fragment enjoys the above nice properties, including decidability, through an effectively bounded finite model property. (These are new results, obtained by generalizing notions and techniques from modal logic.) Moreover, its own internal finite variable hierarchy turns out to work well. Finally, we shall make another move. The above analogy works both ways. Modal operators are like quantifiers, but quantifiers are also like modal operators. This observation inspires a generalized semantics for first-order predicate logic with accessibility constraints on available assignments (cf. N´emeti 1986, 1992) which moves the earlier quantifier restrictions into the semantics. This provides a fresh look at the landscape of possible predicate logics, including candidates sharing various desirable features with basic modal logic – in particular, its decidability. (shrink)

The logic RM and its basic fragments (always with implication) are considered here as entire consequence relations, rather than as sets of theorems. A new observation made here is that the disjunction of RM is definable in terms of its other positive propositional connectives, unlike that of R. The basic fragments of RM therefore fall naturally into two classes, according to whether disjunction is or is not definable. In the equivalent quasivariety semantics of these fragments, which consist of subreducts of (...) Sugihara algebras, this corresponds to a distinction between strong and weak congruence properties. The distinction is explored here. A result of Avron is used to provide a local deduction-detachment theorem for the fragments without disjunction. Together with results of Sobociski, Parks and Meyer (which concern theorems only), this leads to axiomatizations of these entire fragments — not merely their theorems. These axiomatizations then form the basis of a proof that all of the basic fragments of RM with implication are finitely axiomatized consequence relations. (shrink)

This article evaluates the scientific credentials of a distinction that is frequently endorsed by scientists who study human reasoning, between so-called “System 1” and “System 2”. The paper argues that one aspect of what is generally intended by this distinction is real. In particular, there is a real distinction between intuitive and reflective cognitive processes. But this distinction fails to line up with many of the other properties attributed to System 1 and System 2. Accordingly, the paper argues that the (...) latter distinction is not real, and should be abandoned. (shrink)

This thesis comprises three main chapters—each comprising one relatively standalone paper. The unifying theme is fragmentalism about truth, which is the view that the predicate “true” either expresses distinct concepts or expresses distinct properties. -/- In Chapter 1, I provide a formal development of alethic pluralism. Pluralism is the view that there are distinct truth properties associated with distinct domains of subject matter, where a truth property satisfies certain truth-characterizing principles. On behalf of pluralists, I propose an account of (...) logic and semantics that shows how they can answer central conceptual and logical challenges for their view. -/- In Chapter 2, I motivate and develop a modal account of propositions on the basis of an iterative conception of propositions, where the modality is logico-mathematical. The modal account of propositions takes the conception to motivate an inherently potential hierarchy of propositions. I show that the account helps provide satisfying solutions to the intensional paradoxes of Russell-Myhill, Kaplan, and Prior. -/- In Chapter 3, I propose that “true” is polysemous. I suggest that “true” is initially polysemous between correspondence truth and disquotational truth, and further polysemous between the meanings corresponding to the subconcepts of the concept truth generated by the indefinite extensibility of that concept. I show that the proposal provides satisfying solutions to the semantic paradoxes. (shrink)

We define classes Φnof formulae of first-order arithmetic with the following properties:(i) Everyφϵ Φnis classically equivalent to a Πn-formula (n≠ 1, Φ1:= Σ1).(ii)(iii)IΠnandiΦn(i.e., Heyting arithmetic with induction schema restricted to Φn-formulae) prove the same Π2-formulae.We further generalize a result by Visser and Wehmeier. namely that prenex induction within intuitionistic arithmetic is rather weak: After closing Φnboth under existential and universal quantification (we call these classes Θn) the corresponding theoriesiΘnstill prove the same Π2-formulae. In a second part we consideriΔ0plus collection-principles. We (...) show that both the provably recursive functions and the provably total functions ofare polynomially bounded. Furthermore we show that the contrapositive of the collection-schema gives rise to instances of the law of excluded middle and hence. (shrink)

In the first part of this paper we investigate the intuitionistic version $iI\!\Sigma_1$ of $I\!\Sigma_1$ (in the language of $PRA$ ), using Kleene's recursive realizability techniques. Our treatment closely parallels the usual one for $HA$ and establishes a number of nice properties for $iI\!\Sigma_1$ , e.g. existence of primitive recursive choice functions (this is established by different means also in [D94]). We then sharpen an unpublished theorem of Visser's to the effect that quantifier alternation alone is much less powerful intuitionistically (...) than classically: $iI\!\Sigma_1$ together with induction over arbitrary prenex formulas is $\Pi_2$ -conservative over $iI\!\Pi_2$ . In the second part of the article we study the relation of $iI\!\Sigma_1$ to $iI\!\Pi_1$ (in the usual arithmetical language). The situation here is markedly different from the classical case in that $iI\!\Pi_1$ and $iI\!\Sigma_1$ are mutually incomparable, while $iI\!\Sigma_1$ is significantly stronger than $iI\!\Pi_1$ as far as provably recursive functions are concerned: All primitive recursive functions can be proved total in $iI\!\Sigma_1$ whereas the provably recursive functions of $iI\!\Pi_1$ are all majorized by polynomials over ${\Bbb N}$ . 0 $iI\!\Pi_1$ is unusual also in that it lacks closure under Markov's Rule $\mbox{MR}_{PR}$. (shrink)

We investigate properties of monadic purely negational fragment of Intuitionistic Control Logic ). This logic arises from Intuitionistic Propositional Logic ) by extending language of \ by additional new constant for falsum. Having two different falsum constants enables to define two forms of negation. We analyse implicational relations between negational monadic formulae and present a poset of non equivalent formulae of this fragment of \.

Human tissue samples are essential to biomedical research, but recent controversies reveal disagreement over how to relate these fragments to donors. Deidentification has become impossible, a property model contravenes legal and religious traditions, and there is conflict over procedures for informed consent. While Michael Banner draws on Augustine and ethnographies to emphasize the role of fragments of the body in mourning, ethnographies actually suggest that many people believe that tissues and organs retain an ongoing connection to their donors. The (...) Christian practice of the veneration of relics and the doctrine of the resurrection of the body support the idea of an ongoing tie between the person and the dead body, a connection affirmed by theologians such as Gregory of Nyssa even when it is unnecessary for their anthropology. This relationship of the donor to tissue supports the ongoing participation of the donor or her family in decisions on research. (shrink)

These two texts come from a store of papyrus fragments which are at present being examined and worked over at Oxford. They are the property of the Egypt Exploration Society and will be republished in vol. xxxi of the Oxyrhynchus Papyri as Nos. 2544 and 2534; permission for their separate publication here has been granted by the Society in view of the relevance of the former of them to the article by Mr. W. S. Barrett which appears on pp. (...) 58–71 below. We are much indebted to Mr. Barrett and Professor Hugh Lloyd-Jones for many valuable suggestions and criticisms. The nature of both texts was recognized by R. A. Coles, of Magdalen College, Oxford, one of the collaborators in this article. (shrink)

Under a proper translation, the languages of propositional (and quantified relevant logic) with an absurdity constant are characterized as the fragments of first order logic preserved under (world-object) relevant directed bisimulations. Furthermore, the properties of pointed models axiomatizable by sets of propositional relevant formulas have a purely algebraic characterization. Finally, a form of the interpolation property holds for the relevant fragment of first order logic.

Objects often manifest themselves in incompatible ways across perspectives that are on a par. Phenomena of this kind have been responsible for crucial revisions to our conception of the world, both philosophical and scientific. The standard response to them is to deny that the way things appear from different perspectives are ways things really are out there, a response that is based on an implicit metaphysical assumption that the world is a unified whole. This dissertation explores the possibility that this (...) assumption is false, that the world is fragmented instead of unified. On the proposed understanding of such worldly fragmentation, there is a notion of co-obtainment according to which two facts may obtain without co-obtaining. Since not every fact that obtains also co-obtains with every other fact, two incompatible facts may both obtain, as long as they do not co-obtain in the introduced sense. The possibility of such fragmentation sheds new light on a range of phenomena. It allows us to explore a view of time that takes the notion of passage as its defining primitive. It bolsters a no-subject view of experience against the objection that it leads to solipsism. It allows a realist view about colours to withstand the objection from conflicting appearances. And, it makes room for a view on which things really have the properties that are attributed to objects and events across different frames of reference, such as length, mass, duration and simultaneity. Overall, fragmentalism changes the way in which the manifest image feeds into an objective conception of the world: what is manifest to us is not misleading in what sort of properties it shows the world to have, it's only misleading in making it seem more unified than it really is. (shrink)

This paper extends the investigations into logical properties of the quantified argument calculus (Quarc) by suggesting a series of proper subsystems which, although retaining the entire vocabulary of Quarc, restrict quantification in such a way as to make the result decidable. The proof of decidability is via a procedure that prunes the infinite branches of a derivation tree in what is a syntactic counterpart of semantic filtration. We demonstrate an application of one of these systems by showing that Aristotle’s assertoric (...) syllogistic is embeddable within, thus also providing another method of showing its decidability. (shrink)

We study the modal properties of intuitionistic modal logics that belong to the provability logic or the preservativity logic of Heyting Arithmetic. We describe the □-fragment of some preservativity logics and we present fixed point theorems for the logics iL and iPL, and show that they imply the Beth property. These results imply that the fixed point theorem and the Beth property hold for both the provability and preservativity logic of Heyting Arithmetic. We present a frame correspondence result (...) for the preservativity principle Wp that is related to an extension of Löb's principle. (shrink)

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)

We prove that every usco multimap $$\varPhi :X\rightarrow Y$$ Φ : X → Y from a metrizable separable space X to a GO-space Y has an $$F_\sigma $$ F σ -measurable selection. On the other hand, for the split interval $${\ddot{\mathbb I}}$$ I ¨ and the projection $$P:{{\ddot{\mathbb I}}}^2\rightarrow \mathbb I^2$$ P : I ¨ 2 → I 2 of its square onto the unit square $$\mathbb I^2$$ I 2, the usco multimap $${P^{-1}:\mathbb I^2\multimap {{\ddot{\mathbb I}}}^2}$$ P - 1 : (...) I 2 ⊸ I ¨ 2 has a Borel selection if and only if the Continuum Hypothesis holds. This CH-example shows that know results on Borel selections of usco maps into fragmentable compact spaces cannot be extended to a wider class of compact spaces. (shrink)

Abstract State Machines (ASMs) provide a formal method for transparent design and specification of complex dynamic systems. They combine advantages of informal and formal methods. Applications of this method motivate a number of computability and decidability problems connected to ASMs. Such problems result for example from the area of verifying properties of ASMs. Their high expressive power leads rather directly to undecidability respectively uncomputability results for most interesting problems in the case of unrestricted ASMs. Consequently, it is rather natural to (...) ask whether there exist expressive classes of ASMs for which we can prove positive decidability and computability results. In this work, we introduce such a class of ASMs. The concept is similar to the one of the guarded fragment of first-order logic. We analyze the expressive power of this class and prove that it is stronger than Datalog LITE and the guarded fragment of first-order fixed point logic. Some decidability and computability results have been proven in earlier works. (shrink)

ABSTRACTCorrespondence and Shalqvist theories for Modal Logics rely on the simple observation that a relational structure is at the same time the basis for a model of modal logic and for a model of first-order logic with a binary predicate for the accessibility relation. If the underlying set of the frame is split into two components,, and, then frames are at the same time the basis for models of non-distributive lattice logic and of two-sorted, residuated modal logic. This suggests that (...) a reduction of the first to the latter may be possible, encoding Positive Lattice Logic as a fragment of Two-Sorted, Residuated Modal Logic. The reduction is analogous to the well-known Gödel-McKinsey-Tarski translation of Intuitionistic Logic into the S4 system of normal modal logic. In this article, we carry out this reduction in detail and we derive some properties of PLL from corresponding properties of First-Order Logic. The reduction we present is extendible to the case of lattices with operators, making use of recent results by this author on the relational representation of normal lattice expansions. (shrink)

This paper describes an axiomatic theory BT, which is a suitable formal theory for developing constructive mathematics, due to its expressive language with countable number of set types and its constructive properties such as the existence and disjunction properties, and consistency with the formal Church thesis. BT has a predicative comprehension axiom and usual combinatorial operations. BT has intuitionistic logic and is consistent with classical logic. BT is mutually interpretable with a so called theory of arithmetical truth PATr and with (...) a second-order arithmetic SA that contains infinitely many sorts of sets of natural numbers. We compare BT with some standard second-order arithmetics and investigate the proof-theoretical strengths of fragments of BT, PATr and SA. (shrink)

This paper presents proof that Buss's S22 can prove the consistency of a fragment of Cook and Urquhart's PV from which induction has been removed but substitution has been retained. This result improves Beckmann's result, which proves the consistency of such a system without substitution in bounded arithmetic S12. Our proof relies on the notion of "computation" of the terms of PV. In our work, we first prove that, in the system under consideration, if an equation is proved and either (...) its left- or right-hand side is computed, then there is a corresponding computation for its right- or left-hand side, respectively. By carefully computing the bound of the size of the computation, the proof of this theorem inside a bounded arithmetic is obtained, from which the consistency of the system is readily proven. This result apparently implies the separation of bounded arithmetic because Buss and Ignjatović stated that it is not possible to prove the consistency of a fragment of PV without induction but with substitution in Buss's S12. However, their proof actually shows that it is not possible to prove the consistency of the system, which is obtained by the addition of propositional logic and other axioms to a system such as ours. On the other hand, the system that we have considered is strictly equational, which is a property on which our proof relies. (shrink)

In his essay The Dynamic Analytics of Property Law, Professor Michael Heller describes and criticizes the familiar, current analytical tools of property theory and calls for the adoption of a more dynamic approach. In this comment, I shall address briefly two issues discussed in Heller's paper: his suggestion that we add a fourth type of property – "anticommons property" – to the well-known "property trilogy" of private property, commons property, and state property; (...) and his critique of the "bundle of rights" approach of the courts to the takings problem, which leads to excessive fragmentation of private property. The former issue nicely demonstrates the current tendency of scholars to argue against "too much private property." The latter illustrates the familiar, futile search of property scholars for an all-encompassing metaphor to describe and identify private property. (shrink)

The fluted fragment is a fragment of first-order logic (without equality) in which, roughly speaking, the order of quantification of variables coincides with the order in which those variables appear as arguments of predicates. It is known that this fragment has the finite model property. We consider extensions of the fluted fragment with various numbers of transitive relations, as well as the equality predicate. In the presence of one transitive relation (together with equality), the finite model property is (...) lost; nevertheless, we show that the satisfiability and finite satisfiability problems for this extension remain decidable. We also show that the corresponding problems in the presence of two transitive relations (with equality) or three transitive relations (without equality) are undecidable, even for the two-variable sub-fragment. (shrink)

In this paper we investigate some basic semantic and syntactic conditions characterizing the equivalence connective. In particular we define three basic classes of algebras: the class of weak equivalential algebras, the class of equivalential algebras and the class of regular equivalential algebras.Weak equivalential algebras can be used to study purely equivalential fragments of relevant logics and strict equivalential fragments of some modal logics. Equivalential algebras are suitable to study purely equivalential fragment of BCI and BCK logic. A subclass of the (...) class of regular equivalential algebras is suitable to study equivalential fragments of ukasiewicz logics. Some subvarieties of the class of regular equivalential algebras provide natural semantics for equivalential fragments of the intuitionistic prepositional logic and various intermediate logics. (shrink)

In the final scene of Michel Tournier’s postcolonial novel La Goutte d’or, the protagonist, Idriss, shatters the glass of a Cristobal & Co. storefront window while operating a jackhammer in the working-class Parisian neighbourhood on the Rue de la Goutte d’or. Glass fragments fly everywhere as the Parisian police arrive. In La Goutte d’or, Tournier explores the identity construction of Idriss through a discussion of the role that visual images play in the development of a twentieth-century consciousness of the “Other.” (...) At the beginning of the novel, a French tourist takes a photograph of Idriss during her visit to the Sahara. The boy’s quest to reclaim his stolen image leads him from the Sahara to Marseille, and finally to the Rue de la Goutte d’or in Paris. The Rue de la Goutte d’or remains one the most cosmopolitan neighbourhoods of the city. In Tournier’s novel, the goutte d’or also corresponds to a symbolic object: a Berber jewel. It is the jewel that Idriss brings with him, but which he also subsequently loses upon his arrival in Marseille. From the very moment that the French tourist photographs him, a marginalization of Idriss’s identity occurs. Marginality, quite literally, refers to the spatial property of a location in which something is situated. Figuratively speaking, marginality suggests something that is on the edges or at the outer limits of social acceptability. In this essay, I explore the construction of the marginalized postcolonial self through an examination of the function of visual representation in the development of a postcolonial identity in La Goutte d’or. In the end, I conclude that the construction of a postcolonial identity is based upon fragmentation and marginalization, which ultimately leads its subject to create an identity based upon false constructions. (shrink)

We do not always talk in complete sentences; we sometimes speak in “fragments“, such as `Fire!', `Off with his head', `From Cuba', `Next!', and `Shall we?'. Research has tended to focus on the ellipsis wars — the issue of whether all or most fragments are really sentential or not. Less effort has been put into the question of exactly how fragments are to be interpreted, especially their force. We separate off the issue of fragment interpretation from the issue of systematically (...) accounting for their linguistic properties — the issue of how to generate fragments. We review two projects directed at the issue of fragment interpretation: Stainton, who approaches the issue obliquely, and Barton, who approaches the issue of interpretation directly and systematically. We find areas of agreement and disagreement with both studies. In the end we conclude that what may be needed is a more speech act oriented approach, one that fits fragment interpretation into a framework for performing, and communicating through, speech acts in general. (shrink)

We do not always talk in complete sentences; we sometimes speak in “fragments“, such as `Fire!', `Off with his head', `From Cuba', `Next!', and `Shall we?'. Research has tended to focus on the ellipsis wars — the issue of whether all or most fragments are really sentential or not. Less effort has been put into the question of exactly how fragments are to be interpreted, especially their force. We separate off the issue of fragment interpretation from the issue of systematically (...) accounting for their linguistic properties — the issue of how to generate fragments. We review two projects directed at the issue of fragment interpretation: Stainton , who approaches the issue obliquely , and Barton , who approaches the issue of interpretation directly and systematically. We find areas of agreement and disagreement with both studies. In the end we conclude that what may be needed is a more speech act oriented approach, one that fits fragment interpretation into a framework for performing, and communicating through, speech acts in general. (shrink)

We give a novel application of algebraic logic to first order logic. A new, flexible construction is presented for representable but not completely representable atomic relation and cylindric algebras of dimension n (for finite n > 2) with the additional property that they are one-generated and the set of all n by n atomic matrices forms a cylindric basis. We use this construction to show that the classical Henkin-Orey omitting types theorem fails for the finite variable fragments of first (...) order logic as long as the number of variables available is > 2 and we have a binary relation symbol in our language. We also prove a stronger result to the effect that there is no finite upper bound for the extra variables needed in the witness formulas. This result further emphasizes the ongoing interplay between algebraic logic and first order logic. (shrink)

Logical geometry systematically studies Aristotelian diagrams, such as the classical square of oppositions and its extensions. These investigations rely heavily on the use of bitstrings, which are compact combinatorial representations of formulas that allow us to quickly determine their Aristotelian relations. However, because of their general nature, bitstrings can be applied to a wide variety of topics in philosophical logic beyond those of logical geometry. Hence, the main aim of this paper is to present a systematic technique for assigning bitstrings (...) to arbitrary finite fragments of formulas in arbitrary logical systems, and to study the logical and combinatorial properties of this technique. It is based on the partition of logical space that is induced by a given fragment, and sheds new light on a number of interesting issues, such as the logic-dependence of the Aristotelian relations and the subtle interplay between the Aristotelian and Boolean structure of logical fragments. Finally, the bitstring technique also allows us to systematically analyze fragments from contemporary logical systems, such as public announcement logic, which could not be done before. (shrink)

This article is a step towards a rethinking of the emergence of the modern state in Europe. Traditionally, war has been viewed as the central mechanism of state formation. This approach claims that war caused the emergence of the modern state in two significant ways: 1) by consolidating the politically fragmented world of the middle ages through conquest; and 2) through the pressure of competition in a Darwinian international system, which forced the polities of Europe to create the bureaucratic structures (...) fundamental to the authority of the modern state. This article seeks to undermine the first of these mechanisms by showing that the territorial consolidation of Europe was a logical result of dynastic lordship. I seek to show that the consolidation of territory and authority into fewer and fewer hands was a direct consequence of dynastic successional practices and therefore that the emphasis on coercion in European political development has been overplayed. (shrink)

A logic |$\mathcal{L}$| is said to satisfy the descending chain condition, DCC, if any descending chain of formulas in |$\mathcal{L}$| with ordering induced by |$\vdash _{\mathcal{L}};$| eventually stops. In this short note, we first establish a general theorem, which states that if a propositional logic |$\mathcal{L}$| satisfies both DCC and has the Craig Interpolation Property, CIP, then it satisfies the Uniform Interpolation Property, UIP, as well. As a result, by using the Nishimura lattice, we give a new simply (...) proof of uniform interpolation for |$\textbf{IPL}_2$|⁠, the two-variable fragment of Intuitionistic Propositional Logic; and one-variable uniform interpolation for |$\textbf{IPL}$|⁠. Also, we will see that the modal logics |$\textbf{S}_4$| and |$\textbf{K}_4$| do not satisfy atomic DCC. (shrink)