We provide sufficient conditions for the existence of a conservative translation from a consequence system to another one. We analyze the problem in many settings, namely when the consequence systems are generated by a deductive calculus or by a logic system including both proof-theoretic and model-theoretic components. We also discuss reflection of several metaproperties with the objective of showing that conservative translations provide an alternative to proving such properties from scratch. We discuss soundness and completeness, disjunction property and metatheorem of (...) deduction among others. We provide several illustrations of conservative translations. (shrink)

The transference of preservation results between importing and unconstrained fibring is investigated. For that purpose, a new formulation of fibring, called biporting, is introduced, and importing is shown to be subsumed by biporting. In consequence, particular cases of importing, like temporalization, modalization and globalization are subsumed by fibring. Capitalizing on these results, the preservation of the finite model property by fibring is transferred to importing and then carried over to globalization.

A graph-theoretic account of logics is explored based on the general notion of m-graph (that is, a graph where each edge can have a finite sequence of nodes as source). Signatures, interpretation structures and deduction systems are seen as m-graphs. After defining a category freely generated by a m-graph, formulas and expressions in general can be seen as morphisms. Moreover, derivations involving rule instantiation are also morphisms. Soundness and completeness theorems are proved. As a consequence of the generality of the (...) approach our results apply to very different logics encompassing, among others, substructural logics as well as logics with nondeterministic semantics, and subsume all logics endowed with an algebraic semantics. (shrink)

A graph-theoretic account of fibring of logics is developed, capitalizing on the interleaving characteristics of fibring at the linguistic, semantic and proof levels. Fibring of two signatures is seen as a multi-graph (m-graph) where the nodes and the m-edges include the sorts and the constructors of the signatures at hand. Fibring of two models is a multi-graph (m-graph) where the nodes and the m-edges are the values and the operations in the models, respectively. Fibring of two deductive systems is an (...) m-graph whose nodes are language expressions and the m-edges represent the inference rules of the two original systems. The sobriety of the approach is confirmed by proving that all the fibring notions are universal constructions. This graph-theoretic view is general enough to accommodate very different fibrings of propositional based logics encompassing logics with non-deterministic semantics, logics with an algebraic semantics, logics with partial semantics and substructural logics, among others. Soundness and weak completeness are proved to be preserved under very general conditions. Strong completeness is also shown to be preserved under tighter conditions. In this setting, the collapsing problem appearing in several combinations of logic systems can be avoided. (shrink)

Importing subsumes several asymmetric ways of combining logics, including modalization and temporalization. A calculus is provided for importing, inheriting the axioms and rules from the given logics and including additional rules for lifting derivations from the imported logic. The calculus is shown to be sound and concretely complete with respect to the semantics of importing as proposed in J. Rasga et al. (100(3):541–581, 2012) Studia Logica.

Combined connectives arise in combined logics. In fibrings, such combined connectives are known as shared connectives and inherit the logical properties of each component. A new way of combining connectives (and other language constructors of propositional nature) is proposed by inheriting only the common logical properties of the components. A sound and complete calculus is provided for reasoning about the latter. The calculus is shown to be a conservative extension of the original calculus. Examples are provided contributing to a better (...) understanding of what are the common properties of any two constructors, say disjunction and conjunction. (shrink)

A probabilistic propositional logic, endowed with a constructor for asserting compatibility of diagonalisable and bounded observables, is presented and illustrated for reasoning about the random results of projective measurements made on a given quantum state. Simultaneous measurements are assumed to imply that the underlying observables are compatible. A sound and weakly complete axiomatisation is provided relying on the decidable first-order theory of real closed ordered fields. The proposed logic is proved to be a conservative extension of classical propositional logic.

We address the problem of combining intuitionistic and S4 modal logic in a non-collapsing way inspired by the recent works in combining intuitionistic and classical logic. The combined language includes the shared constructors of both logics namely conjunction, disjunction and falsum as well as the intuitionistic implication, the classical implication and the necessity modality.We present a Gentzen calculus for the combined logic defined over a Gentzen calculus for the host S4 modal logic. The semantics is provided by Kripke structures. The (...) calculus is proved to be sound and complete with respect to this semantics. We also show that the combined logic is a conservative extension of each component. Finally we establish that the Gentzen calculus for the combined logic enjoys cut elimination. (shrink)

Satisfaction systems and reductions between them are presented as an appropriate context for analyzing the satisfiability and the validity problems. The notion of reduction is generalized in order to cope with the meet-combination of logics. Reductions between satisfaction systems induce reductions between the respective satisfiability problems and (under mild conditions) also between their validity problems. Sufficient conditions are provided for relating satisfiability problems to validity problems. Reflection results for decidability in the presence of reductions are established. The validity problem in (...) the meet-combination is proved to be decidable whenever the validity problem for the components are decidable. Several examples are discussed, namely, involving modal and intuitionistic logics, as well as the meet-combination of modal logic and intuitionistic logic. (shrink)

Sufficient conditions for first-order-based sequent calculi to admit cut elimination by a Schütte–Tait style cut elimination proof are established. The worst case complexity of the cut elimination is analysed. The obtained upper bound is parameterized by a quantity related to the calculus. The conditions are general enough to be satisfied by a wide class of sequent calculi encompassing, among others, some sequent calculi presentations for the first order and the propositional versions of classical and intuitionistic logic, classical and intuitionistic modal (...) logic S4, and classical and intuitionistic linear logic and some of its fragments. Moreover the conditions are such that there is an algorithm for checking if they are satisfied by a sequent calculus. (shrink)

Information can be public among a group. Whether or not information is public matters, for example, for accounts of interdependent rational choice, of communication, and of joint intention. A standard analysis of public information identifies it with (some variant of) common belief. The latter notion is stipulatively defined as an infinite conjunction: for p to be commonly believed is for it to believed by all members of a group, for all members to believe that all members believe it, and so (...) forth. This analysis is often presupposed without much argument in philosophy. Theoretical entrenchment or intuitions about cases might give some traction on the question, but give little insight about why the identification holds, if it does. The strategy of this paper is to characterize a practical-normative role for information being public, and show that the only things that play that role are (variants of) common belief as stipulatively characterized. In more detail: a functional role for “taking a proposition for granted” in non-isolated decision making is characterized. I then present some minimal conditions under which such an attitude is correctly held. The key assumption links this attitude to beliefs about what is public. From minimal a priori principles, we can argue that a proposition being public among a group entails common commitment to believe among that group. Later sections explore partial converses to this result, the factivity of publicity and publicity from the perspective of outsiders to the group, and objections to the aprioricity of the result deriving from a posteriori existential presuppositions. (shrink)

Should we regard Jennifer Lackey’s ‘Creationist Teacher’ as understanding evolution, even though she does not, given her religious convictions, believe its central claims? We think this question raises a range of important and unexplored questions about the relationship between understanding, factivity and belief. Our aim will be to diagnose this case in a principled way, and in doing so, to make some progress toward appreciating what objectual understanding—i.e., understanding a subject matter or body of information—demands of us. Here is the (...) plan. After some ground clearing in §1, §2 outlines and motivates a plausible working model—moderate factivity—for characterising the sense in which objectual understanding should be regarded as factive. §3 shows how the datum that we can understand false theories can, despite initial suggestions to the contrary, be assimilated straightforwardly within the moderate factivity model. §4 highlights how the inverse kind of case to that explored in §3—viz., a variant of Lackey’s creationist teacher case—poses special problems for moderate factivity. With reference to recent work on moral understanding by Hills, §5 proposes a solution to the problem, and §6 attempts to diagnose why it is that we might originally have been led to draw the wrong conclusion. (shrink)

The main objective of this paper is to define a logic for reasoning about distributed time-stamped claims. Such a logic is interesting for theoretical reasons, i.e. as a logic per se, but also because it has a number of practical applications, in particular when one needs to reason about a huge amount of pieces of evidence collected from different sources, where some of the pieces of evidence may be contradictory and some sources are considered to be more trustworthy than others. (...) We introduce the time-stamped claim logic including a sound and complete sequent calculus. In order to show how time-stamped claim logic can be used in practice, we consider a concrete cyber-attribution case study. (shrink)

The novel notion of importing logics is introduced, subsuming as special cases several kinds of asymmetric combination mechanisms, like temporalization [8, 9], modalization [7] and exogenous enrichment [13, 5, 12, 4, 1]. The graph-theoretic approach proposed in [15] is used, but formulas are identified with irreducible paths in the signature multi-graph instead of equivalence classes of such paths, facilitating proofs involving inductions on formulas. Importing is proved to be strongly conservative. Conservative results follow as corollaries for temporalization, modalization and exogenous (...) enrichment. (shrink)

A new technique is presented for proving that a consequence system enjoys Craig interpolation or Maehara interpolation based on the fact that these properties hold in another consequence system. This technique is based on the existence of a back and forth translation satisfying some properties between the consequence systems. Some examples of translations satisfying those properties are described. Namely a translation between the global/local consequence systems induced by fragments of linear logic, a Kolmogorov-Gentzen-Gödel style translation, and a new translation between (...) the global consequence systems induced by full Lambek calculus and linear logic, mixing features of a Kiriyama-Ono style translation with features of a Kolmogorov-Gentzen-Gödel style translation. These translations establish a strong relationship between the logics involved and are used to obtain new results about whether Craig interpolation and Maehara interpolation hold in that logics . (shrink)

We extend meet-combination of logics for capturing the consequences that are common to both logics. With this purpose in mind we define meet-combination of consequence systems. This notion has the advantage of accommodating different ways of presenting the semantics and the deductive calculi. We consider consequence systems generated by a matrix semantics and consequence systems generated by Hilbert calculi. The meet-combination of consequence systems generated by matrix semantics is the consequence system generated by their product. On the other hand, the (...) meet-combination of consequence systems generated by Hilbert calculi is the consequence system generated by their interconnection. We investigate preservation of several properties. Capitalizing on these results we show that interconnection provides an axiomatization for the product. Illustrations are given for intuitionistic and modal logics, Łukasiewicz logic and some paraconsistent logics. (shrink)

Arrow and turnstile interpolations are investigated in UCL [introduced by Sernadas et al. ], a logic that is a complete extension of classical propositional logic for reasoning about connectives that only behave as expected with a given probability. Arrow interpolation is shown to hold in general and turnstile interpolation is established under some provisos.

Cut elimination is shown, in a constructive way, to hold in sequent calculi labelled with truth values for a wide class of normal modal logics, supporting global and local reasoning and allowing a general frame semantics. The complexity of cut elimination is studied in terms of the increase of logical depth of the derivations. A hyperexponential worst case bound is established. The subformula property and a similar property for the label terms are shown to be satisfied by that class of (...) modal sequent calculi. Modal logics presented by these calculi are proven to be globally and locally consistent. (shrink)

We give an axiomatization of first‐order logic enriched with the almost‐everywhere quantifier over finitely additive measures. Using an adapted version of the consistency property adequate for dealing with this generalized quantifier, we show that such a logic is both strongly complete and enjoys Craig interpolation, relying on a (countable) model existence theorem. We also discuss possible extensions of these results to the almost‐everywhere quantifier over countably additive measures.

Fusion is a well-known form of combining normal modal logics endowed with a Hilbert calculi and a Kripke semantics. Herein, fusion is studied over logic systems using sequent calculi labelled with truth values and with a semantics based on a two-sorted algebra allowing, in particular, the representation of general Kripke structures. A wide variety of logics, including non-classical logics like, for instance, modal logics and intuitionistic logic can be presented by logic systems of this kind. A categorical approach of fusion (...) is defined in the context of these logic systems. Preservation of soundness and completeness by fusion is studied. Soundness is preserved without further requirements, completeness is preserved under mild assumptions. (shrink)

Linear temporal logic with Since and Until modalities is expressively equivalent, over the class of complete linear orders, to a fragment of first-order logic known as FOMLO. It turns out that LTL, under some basic assumptions, is expressively complete if and only if it has the property, called separation, that every formula is equivalent to a Boolean combination of formulas that each refer only to the past, present or future. Herein we present simple algorithms and their implementations to perform separation (...) of the LTL with Since and Until, over discrete and complete linear orders, and translation from FOMLO formulas into equivalent temporal logic formulas. We additionally show that the separation of a certain fragment of LTL results in at most a double exponential size growth. (shrink)

The theory of mental models postulates that meaning and knowledge can modulate the interpretation of conditionals. The theory's computer implementation implied that certain conditionals should be true or false without the need for evidence. Three experiments corroborated this prediction. In Experiment 1, nearly 500 participants evaluated 24 conditionals as true or false, and they justified their judgments by completing sentences of the form, It is impossible that A and ___ appropriately. In Experiment 2, participants evaluated 16 conditionals and provided their (...) own justifications, which tended to be explanations rather than logical justifications. In Experiment 3, the participants also evaluated as possible or impossible each of the four cases in the partitions of 16 conditionals: A and C, A and not-C, not-A and C, not-A and not-C. These evaluations corroborated the model theory. We consider the implications of these results for theories of reasoning based on logic, probabilistic logic, and suppositions. (shrink)

Protagoras, of all the ancient philosophers, has perhaps attracted the most interest in modern times. His saying ‘Man is the measure of all things’ caused Schiller to adopt him as the patron of the Oxford pragmatists, and has generally earned him the title of the first humanist. Yet the exact delineation of his philosophcal position remains a baffling task. Neumann, writing on Die Problematik des ‘Homo-mensura’ Satzes in 1938,2 concludes that no certainty whatever can be reached on the meaning of (...) the dictum, since ‘man’, ‘measure’, and ‘things’ are all ambiguous, nor can we tell which of the three is the predicate. The time is past when it was believed that a man's philosophy could be understood apart from the events of his life and the circumstances of his age: yet in the case of Protagoras the historical method of approach has hardly been attempted, although the impact of environment was perhaps more decisive in the formation of philosophical concepts in the Greek world than anywhere else. The reality about which the Greek philosopher spoke had three aspects: it was either the one universe of physics, or the political unity, or God. For example, the book of Heracleitus Περ φσεως was divided into three chapters or logoi, About the Whole, a political, and a theological. Neither physics nor theology supplies from its own subject-matter the form in which this reality was described. (shrink)

Fibring is recognized as one of the main mechanisms in combining logics, with great signicance in the theory and applications of mathematical logic. However, an open challenge to bring is posed by the collapsing problem: even when no symbols are shared, certain combinations of logics simply collapse to one of them, indicating that bring imposes unwanted interconnections between the given logics. Modulated bring allows a ner control of the combination, solving the collapsing problem both at the semantic and deductive levels. (...) Main properties like soundness and completeness are shown to be preserved, comparison with bring is discussed, and some important classes of examples are analyzed with respect to the collapsing problem. (shrink)

In this article I try to refute the so-called "libertarian" theory of free will, and to examine how our conclusion ought to modify our common attitudes of praise and blame. In attacking the libertarian view, I shall try to show that it cannot be consistently stated. That is, my dscussion will be an "analytic-philosophic" one. I shall neglect what I think is in practice an equally powerful method of attack on the libertarian: a challenge to state his theory in such (...) a way that it will fit in the modern biology and psychology, which are becoming increasingly physicalistic. (shrink)

Living out of silence, out of a fully functioning, lovingly attentive mind, and not just out of thought, out of a partially functioning mind, is requisite for depth or profundity in living or relating. A fully attentive, truly silent or meditative mind sees that there is real dualism of time and the timeless and that time and the timeless each has its own unique value. The timeless, or real silence, that which alone can make for depth in one's living and (...) relating, can be there only when, in one's awareness, time and all that is related to time, have come to an end. An examination of a wide variety of statements made by writers, both past and present, shows that these understandings are seldom there in contemporary writings, just as they were not there in writings that have come down to us from the past. 'Living beyond the One and the Many' invites readers to consider the possibility that what is presented in it can bring deep meaning to one's way of living in the world"--Publisher's description, back cover. (shrink)

If the world itself is metaphysically indeterminate in a specified respect, what follows? In this paper, we develop a theory of metaphysical indeterminacy answering this question.

We introduce a general recipe for presenting non-classical logics in a modular and uniform way as labelled deduction systems. Our recipe is based on a labelling mechanism where labels are general entities that are present, in one way or another, in all logics, namely truth-values. More specifically, the main idea underlying our approach is the use of algebras of truth-values, whose operators reflect the semantics we have in mind, as the labelling algebras of our labelled deduction systems. The “truth-values as (...) labels” approach allows us to give generalized systems for multiple-valued logics within the same formalism: since we can take multiple-valued logics as meaning not only finitely or infinitely many-valued logics but also power-set logics, i.e. logics for which the denotation of a formula can be seen as a set of worlds, our recipe allows us to capture also logics such as modal, intuitionistic and relevance logics, thus providing a first step towards the fibring of these logics with many-valued ones. (shrink)

Telling a patient that the outcome of his illness is not good, or even hopeless, requires sensitivity and the ability to communicate with him in the setting of a hospital which is an unnatural environment divorced from family and friends. It is a task which must be taught and learned by doctors and nurses.

The achievements of the textile industry in Roman Britain are often underestimated as a result of the meagreness of our available evidence. The Edict on maximum prices issued by Diocletian in A.D. 301 shows that British capes commanded high prices on the markets of the Empire, and that in the late third century A.D. British rugs were the best in the world. In view of the competition from the traditional centres of rug manufacture in the East, this is an astonishing (...) achievement. (shrink)

The received translation and interpretation of many of the technical terms current in the textile industry of the Roman Empire are inaccurate, because lexicographers have either fought shy of being precise, or have thought that they recognized in the ancient world technical processes which originated at a much later date. The evidence is often equivocal or insufficient, but may still yield details that have been overlooked. The textile expression scutulatus, to take an example, deserves more attention than Blümner has devoted (...) to it. When it refers to the appearance of a garment, Lewis and Short, s.v. scutulatus, translate ‘diamond or lozenge-shaped, checkered’. It seems worth while to attempt a more precise translation, and, if possible, to estimate the significance in context of the goods so designated. (shrink)

The essential structure of proofs is proposed as the basis for a measure of complexity of formulas in FOL. The motivating idea was the recognition that distinct theorems can have the same derivation modulo some non essential details. Hence the difficulty in proving them is identical and so their complexity should be the same. We propose a notion of complexity of formulas capturing this property. With this purpose, we introduce the notions of schema calculus, schema derivation and description complexity of (...) a schema formula. Based on these concepts we prove general robustness results that relate the complexity of introducing a logical constructor with the complexity of the component schema formulas as well as the complexity of a schema formula across different schema calculi. (shrink)

The existential analysis -- The death of dasein -- The timeliness of dasein -- The derivation of time -- The time of being.