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.

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.

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)

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.

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)

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)

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)

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)

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)

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)

Recent studies indicate that mammalian chromosomes contain discretecis‐acting loci that control replication timing, mitotic condensation, and stability of entire chromosomes. Disruption of the large non‐coding RNA gene ASAR6 results in late replication, an under‐condensed appearance during mitosis, and structural instability of human chromosome 6. Similarly, disruption of the mouse Xist gene in adult somatic cells results in a late replication and instability phenotype on the X chromosome. ASAR6 shares many characteristics with Xist, including random mono‐allelic expression and asynchronous replication timing. (...) Additional “chromosome engineering” studies indicate that certain chromosome rearrangements affecting many different chromosomes display this abnormal replication and instability phenotype. These observations suggest that all mammalian chromosomes contain “inactivation/stability centers” that control proper replication, condensation, and stability of individual chromosomes. Therefore, mammalian chromosomes contain four types ofcis‐acting elements, origins, telomeres, centromeres, and “inactivation/stability centers”, all functioning to ensure proper replication, condensation, segregation, and stability of individual chromosomes. (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.

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)

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)

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)

A historical investigation of the exclusion of Africa and Asia from modern histories of philosophy.

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)

Vaesen infers unique properties of mind from the appearance of specific cultural innovation – a correlation without causal direction. Shifts in habitat, population density, and group dynamics are the only independently verifiable incentives for changes in cultural practices. The transition from Acheulean to Late Stone Age technologies requires that we consider how population and social dynamics affect cultural innovation and mental function.

The first English translation of Fichte’s second set of 1804 lectures on the Wissenschaftslehre.

Orthologic is defined by weakening the axioms and rules of inference of the classical propositional calculus. The resulting Lindenbaum-Tarski quotient algebra is an orthoimplication algebra which generalizes the author's implication algebra. The associated order structure is a semi-orthomodular lattice. The theory of orthomodular lattices is obtained by adjoining a falsity symbol to the underlying orthologic or a least element to the orthoimplication algebra.

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)

Scientists and laypeople alike use the sense of understanding that an explanation conveys as a cue to good or correct explanation. Although the occurrence of this sense or feeling of understanding is neither necessary nor sufficient for good explanation, it does drive judgments of the plausibility and, ultimately, the acceptability, of an explanation. This paper presents evidence that the sense of understanding is in part the routine consequence of two well-documented biases in cognitive psychology: overconfidence and hindsight. In light of (...) the prevalence of counterfeit understanding in the history of science, I argue that many forms of cognitive achievement do not involve a sense of understanding, and that only the truth or accuracy of an explanation make the sense of understanding a valid cue to genuine understanding. (shrink)

The purpose of this text is to draw attention to eight forgotten heroes: William C. Bagley, Charles DeGarmo, David Felmley, William Torrey Harris, Isaac L. Kandel, Charles McMurry, William C. Ruediger, and Edward Austin Sheldon. They have been marginalized from our profession, and drawing upon their legacy is the best hope for restoring the profession of teaching today. This work also includes a chapter at the end of the book entitled "John Dewey's Forgotten Essays." The audience for this book includes: (...) 1) classroom teachers, 2) school administrators, 3) teacher educators, 4) deans and other university administrators, 5) college and university presidents, 6) legislators, 7) historians of education, 8) curriculum specialists, 9) specialists in teacher training, and 10) the general public. (shrink)

Knowledge, like other things of value, can be faked. According to Hawley (2011), know-how is harder to fake than knowledge-that, given that merely apparent propositional knowledge is in general more resilient to our attempts at successful detection than are corresponding attempts to fake know-how. While Hawley’s reasoning for a kind of detection resilience asymmetry between know-how and know-that looks initially plausible, it should ultimately be resisted. In showing why, we outline different ways in which know-how can be faked even when (...) a given performance is successful; and in doing so, we distinguish how know-how can be faked (no less than know-that) via upstream and downstream indicators of its presence, and within each of these categories, we’ll distinguish (in connection with detection resilience) both faking symptoms and (various kinds of) criteria. The unappreciated resilience of faked knowledge-how to successful detection highlights a largely overlooked dimension of social-epistemic risk – risk we face not just in our capacity as recipients of testimony, but in our capacity as both (would-be) apprentices and clients of knowledge-how. (shrink)

In management research, theory testing confronts a paradox described by Meehl in which designing studies with greater methodological rigor puts theories at less risk of falsification. This paradox exists because most management theories make predictions that are merely directional, such as stating that two variables will be positively or negatively related. As methodological rigor increases, the probability that an estimated effect will differ from zero likewise increases, and the likelihood of finding support for a directional prediction boils down to a (...) coin toss. This paradox can be resolved by developing theories with greater precision, such that their propositions predict something more meaningful than deviations from zero. This article evaluates the precision of theories in management research, offers guidelines for making theories more precise, and discusses ways to overcome barriers to the pursuit of theoretical precision. (shrink)

The philosophical literature on sport and games has had little to say about boredom beyond presuming that sports and games can be important ways of overcoming or preventing it. But boredom is an interesting and often misunderstood phenomenon with overlooked implications in this context. Boredom has significant human value and motivates play in ways that contribute to well-being and culture, often through encouraging engaged agency and exploration of novelty. Understanding boredom can also help to clarify problems and tendencies in sports (...) and games that qualify them as havens from boredom. (shrink)