In this paper we introduce canonical extensions of partially ordered sets and monotone maps and a corresponding discrete duality. We then use these to give a uniform treatment of completeness of relational semantics for various substructural logics with implication as the residual(s) of fusion.

This article presents an approach to the semantics of non-distributive propositional logics that is based on a lattice representation theorem that delivers a canonical extension of the lattice. Our approach supports both a plain Kripke-style semantics and, by restriction, a general frame semantics. Unlike the framework of generalized Kripke frames, the semantic approach presented in this article is suitable for modeling applied logics, as it respects the intended interpretation of the logical operators. This is made possible by restricting (...) admissible interpretations. (shrink)

The paper investigates completions in the context of finitely generated lattice-based varieties of algebras. In particular the structure of canonical extensions in such a variety $${\mathcal {A}}$$ is explored, and the role of the natural extension in providing a realisation of the canonical extension is discussed. The completions considered are Boolean topological algebras with respect to the interval topology, and consequences of this feature for their structure are revealed. In addition, we call on recent results from (...) duality theory to show that topological and discrete dualities for $${\mathcal {A}}$$ exist in partnership. (shrink)

Canonical extension has proven to be a powerful tool in algebraic study of propositional logics. In this paper we describe a generalisation of the theory of canonical extension to the setting of first order logic. We define a notion of canonical extension for coherent categories. These are the categorical analogues of distributive lattices and they provide categorical semantics for coherent logic, the fragment of first order logic in the connectives ∧, ∨, 0, 1 and (...) ∃. We describe a universal property of our construction and show that it generalises the existing notion of canonical extension for distributive lattices. Our new construction for coherent categories has led us to an alternative description of the topos of types, introduced by Makkai in [22]. This allows us to give new and transparent proofs of some properties of the action of the topos of types construction on morphisms. Furthermore, we prove a new result relating, for a coherent category C, its topos of types to its category of models. (shrink)

In this paper we introduce canonical extensions of partially ordered sets and monotone maps and a corresponding discrete duality. We then use these to give a uniform treatment of completeness of relational semantics for various substructural logics with implication as the residual(s) of fusion.

This work is part of a wider investigation into lattice-structured algebras and associated dual representations obtained via the methodology of canonical extensions. To this end, here we study lattices, not necessarily distributive, with negation operations. We consider equational classes of lattices equipped with a negation operation ¬ which is dually self-adjoint (the pair (¬,¬) is a Galois connection) and other axioms are added so as to give classes of lattices in which the negation is De Morgan, orthonegation, antilogism, pseudocomplementation (...) or weak pseudocomplementation. These classes are shown to be canonical and dual relational structures are given in a generalized Kripke-style. The fact that the negation is dually self-adjoint plays an important role here, as it implies that it sends arbitrary joins to meets and that will allow us to define the dual structures in a uniform way. (shrink)

We introduce a new and general notion of canonical extension for algebras in the algebraic counterpart of any finitary and congruential logic . This definition is logic-based rather than purely order-theoretic and is in general different from the definition of canonical extensions for monotone poset expansions, but the two definitions agree whenever the algebras in are based on lattices. As a case study on logics purely based on implication, we prove that the varieties of Hilbert and Tarski (...) algebras are canonical in this new sense. (shrink)

The main goal of this paper is to explain the link between the algebraic and the Kripke-style models for certain classes of propositional logics. We start by presenting a Priestley-type duality for distributive lattices endowed with a general class of well-behaved operators. We then show that finitely-generated varieties of distributive lattices with operators are closed under canonical embedding algebras. The results are used in the second part of the paper to construct topological and non-topological Kripke-style models for logics that (...) are sound and complete with respect to varieties of distributive lattices with operators in the above-mentioned classes. (shrink)

The main goal of this paper is to explain the link between the algebraic models and the Kripke-style models for certain classes of propositional non-classical logics. We consider logics that are sound and complete with respect to varieties of distributive lattices with certain classes of well-behaved operators for which a Priestley-style duality holds, and present a way of constructing topological and non-topological Kripke-style models for these types of logics. Moreover, we show that, under certain additional assumptions on the variety of (...) the algerabic models of the given logics, soundness and completeness with respect to these classes of Kripke-style models follows by using entirely algebraical arguments from the soundness and completeness of the logic with respect to its algebraic models. (shrink)

This paper is a study of duality in the absence of canonicity. Specifically it concerns double quasioperator algebras, a class of distributive lattice expansions in which, coordinatewise, each operation either preserves both join and meet or reverses them. A variety of DQAs need not be canonical, but as has been shown in a companion paper, it is canonical in a generalized sense and an algebraic correspondence theorem is available. For very many varieties, canonicity (as traditionally defined) and correspondence (...) lead on to topological dualities in which the topological and correspondence components are quite separate. It is shown that, for DQAs, generalized canonicity is sufficient to yield, in a uniform way, topological dualities in the same style as those for canonical varieties. However topology and correspondence are no longer separable in the same way. (shrink)

In this paper thecanonicalmodal logics, a kind of complete modal logics introduced in K. Fine [4] and R. I. Goldblatt [5], will be characterized semantically using the concept of anultrafilter extension, an operation on frames inspired by the algebraic theory of modal logic. Theorem 8 of R. I. Goldblatt and S. K. Thomason [6] characterizing the modally definable Σ⊿-elementary classes of frames will follow as a corollary. A second corollary is Theorem 2 of [4] which states that any complete (...) modal logic defining a Σ⊿-elementary class of frames is canonical.The main tool in obtaining these results is the duality between modal algebras and general frames developed in R. I. Goldblatt [5]. The relevant notions and results from this theory will be stated in §2. The concept of a canonical modal logic is introduced and motivated in §3, which also contains the above-mentioned theorems. In §4, a kind of appendix to the preceding discussion, preservation of first-order sentences under ultrafilter extensions is discussed.The modal language to be considered here has an infinite supply of proposition letters, a propositional constant ⊥, the usual Boolean operators ¬, ∨, ∨, →, and ↔ —with ¬ and ∨ regarded as primitives—and the two unary modal operators ◇ and □ — ◇ being regarded as primitive. Modal formulas will be denoted by lower case Greek letters, sets of formulas by Greek capitals. (shrink)

The quantified extension of a canonical prepositional intermediate logic is complete with respect to the generalization of Kripke semantics taking into consideration set-valued functors defined on a category.

Interpreting the diamond of modal logic as the derivative, we present a topological canonical model for extensions of K4 and show completeness for various logics. We also show that if a logic is topologically canonical, then it is relationally canonical.

L’examen du « canon des Ecritures », après la consécration de l’expression par Athanase au IVe siècle, révèle d’abord une époque où une certaine fluidité caractérisait la réflexion sur l’extension des Ecritures et sur leurs limites. A partir du IVe siècle, une mutation décisive se produit, à laquelle il faut adjoindre une autre évolution sémantique préparée de longue date à travers l’emploi de diatèkè, traduit en latin par testamentum. Ainsi apparaissent deux temps forts dans l’histoire des Ecritures aux premiers (...) siècles du christianisme. Le premier est celui de l’extension du concept de livre saint à d’autres textes que les écrits hérités du judaïsme ; le second, dans la seconde moitié du IVe siècle, est celui des efforts de délimitation de l’Ancien et du Nouveau Testament, des décisions prises pour trancher les débats, commencés deux siècles plus tôt. L’examen de quelques-uns des problèmes que pose l’extension du canon et qui s’offrent ici à l’historien confirme qu’ils ne sont pas résolus définitivement par les Eglises.An examination of the ³canon of the Scriptures,² after the consecration of Athanasius¹ expression in the 4th century, first of all reveals a period when a certain fluidity characterized reflection on the extension of the Scriptures and their limits. From the 4th century a decisive change came about, to which must be added another semantic evolution, which was prepared for a long time through the use of diatéké, translated in Latin by testamentum. Thus, two important periods in the history of the Scriptures appear in the first centuries of Christianity. In the first there was an extension of the concept of the sacred book to texts other than the inherited writings of Judaism. The second period, in the second half of the 4th century, concerns efforts to demarcate the Old and New Testaments, and decisions taken to settle the debates begun two centuries earlier. The examination of some of these problems about the extension of the canon is offered here to the historian and confirms that they are not definitively resolved by the Churches. (shrink)

We generalize the incompleteness proof of the modal predicate logic Q-S4+ p p + BF described in Hughes-Cresswell [6]. As a corollary, we show that, for every subframe logic Lcontaining S4, Kripke completeness of Q-L+ BF implies the finite embedding property of L.

We generalize and extend the class of Sahlqvist formulae in arbitrary polyadic modal languages, to the class of so called inductive formulae. To introduce them we use a representation of modal polyadic languages in a combinatorial style and thus, in particular, develop what we believe to be a better syntactic approach to elementary canonical formulae altogether. By generalizing the method of minimal valuations à la Sahlqvist–van Benthem and the topological approach of Sambin and Vaccaro we prove that all inductive (...) formulae are elementary canonical and thus extend Sahlqvist’s theorem over them. In particular, we give a simple example of an inductive formula which is not frame-equivalent to any Sahlqvist formula. Then, after a deeper analysis of the inductive formulae as set-theoretic operators in descriptive and Kripke frames, we establish a somewhat stronger model-theoretic characterization of these formulae in terms of a suitable equivalence to syntactically simpler formulae in the extension of the language with reversive modalities. Lastly, we study and characterize the elementary canonical formulae in reversive languages with nominals, where the relevant notion of persistence is with respect to discrete frames. (shrink)

We develop canonical rules capable of axiomatizing all systems of multiple-conclusion rules over K4 or IPC, by extension of the method of canonical formulas by Zakharyaschev [37]. We use the framework to give an alternative proof of the known analysis of admissible rules in basic transitive logics, which additionally yields the following dichotomy: any canonical rule is either admissible in the logic, or it is equivalent to an assumption-free rule. Other applications of canonical rules include (...) a generalization of the Blok–Esakia theorem and the theory of modal companions to systems of multiple-conclusion rules or (finitary structural global) consequence relations, and a characterization of splittings in the lattices of consequence relations over monomodal or superintuitionistic logics with the finite model property. (shrink)

A canonical Gentzen-type system is a system in which every rule has the subformula property, it introduces exactly one occurrence of a connective, and it imposes no restrictions on the contexts of its applications. A larger class of Gentzen-type systems which is also extensively in use is that of quasi-canonical systems. In such systems a special role is given to a unary connective \ of the language. Accordingly, each application of a logical rule in such systems introduces either (...) a formula of the form \\), or of the form \\), and all the active formulas of its premises belong to the set \. In this paper we investigate the whole class of quasi-canonical systems. We provide a constructive coherence criterion for such systems, and show that a quasi-canonical system is coherent iff it is analytic iff it has a characteristic non-deterministic matrix which is based on some subset of the set of the four truth-values which are used in the famous Dunn–Belnap four-valued matrix for information processing. In addition, we determine when a quasi-canonical system admits cut-elimination. (shrink)

I build a canonical model for constant domain basic first-order logic (BQLCD), the constant domain first-order extension of Visser’s basic propositional logic, and use the canonical model to verify that BQLCD satisfies the disjunction and existence properties.

Le procédé de la détermination du Canon des Ecritures a été celui de l'identification par elle-même de la koinonia, même si le but immédiat était celui de la préservation de l'évangile. La koinonia, mode de participation à l'échange et la réciprocité de vie entre le Père, le Fils et le Saint-Esprit, de même que la relationalité ecclésiale entre les églises, bâties sur cette vie trinitaire rendue visible en Jésus-Christ par le pouvoir de l'Esprit, s'exprime dans la détermination du canon. Cette (...) expression historique se voit dans la perichoresis organique dans le vie de l'Eglise entre les critères pour inclusion dans le canon ; l'extension de l'apostolicité ecclésiale par une sorte de communicatio idiomatum des églises apostoliques aux églises non-apostoliques; la réciprocité et la mutualité entre canon et Eglise ; la participation et la relationalité des communions locales dans la communion des communions, à la fois par extension historique en arrière et extension géographique dans l'espace présent; l'exercice de la koinonia par l'activité synodale; le Saint-Esprit comme mémoire de l'Eglise. Comme la détermination du canon concerne toute la vie historique de l'Eglise, elle ne peut être ni défaite, ni refaite. (shrink)

Let S be a set, P the class of all subsets of S and F the class of all fuzzy subsets of S. In this paper an “extension principle” for closure operators and, in particular, for deduction systems is proposed and examined. Namely we propose a way to extend any closure operator J defined in P into a fuzzy closure operator J* defined in F. This enables us to give the notion of canonical extension of a deduction (...) system and to give interesting examples of fuzzy logics. In particular, the canonical extension of the classical propositional calculus is defined and it is showed its connection with possibility and necessity measures. Also, the canonical extension of first order logic enables us to extend some basic notions of programming logic, namely to define the fuzzy Herbrand models of a fuzzy program. Finally, we show that the extension principle enables us to obtain fuzzy logics related to fuzzy subalgebra theory and graded consequence relation theory. (shrink)

This article introduces and motivates the notion of a “properly extensive” quantity by means of a puzzle about the reliability of certain canonical length measurements. An account of these measurements’ success, I argue, requires a modally robust connection between quantitative structure and mereology that is not mediated by the dynamics and is stronger than the constraints imposed by “mere additivity.” I outline what it means to say that length is not just extensive but properly so and then briefly sketch (...) an application of proper extensiveness to the project of providing a reductive ground for metric quantitative structure. (shrink)

¿Qué entendemos hoy por canon en el ámbito de la filosofía? El sentido más habitual de esta palabra remite a una lista o catálogo de autores y de textos que se consideran fundamentales con respecto a un determinado recorte de la filosofía y a veces a la filosofía en su totalidad. Este sentido de canon, por extensión, suele tener una connotación de norma, precepto o regla, en la medida en que la lista de obras o autores es juzgada como necesaria (...) para alcanzar un conocimiento o dominio de la filosofía. Está ligado con la formación de los filósofos en el marco de una institución de enseñanza. El propósito de este trabajo es deconstruir este sentido de canon, considerando sus elementos como piezas de un modelo que puede armarse, desarmarse y rearmarse. Antes de esta deconstrucción, será necesario hablar del lugar donde se construye y delinear cuáles son sus rasgos definitorios, incluyendo sus modos de construcción y reproducción. A ello estará dedicada la primera sección de este texto. Las tres secciones que siguen se concentrarán en cada de las piezas básicas que constituyen los cánones filosóficos: los autores, las obras y los temas. (shrink)

The aim of the paper is to develop the notion of partial probability distributions as being more realistic models of belief systems than the standard accounts. We formulate the theory of partial probability functions independently of any classical semantic notions. We use the partial probability distributions to develop a formal semantics for partial propositional calculi, with extensions to predicate logic and higher order languages. We give a proof theory for the partial logics and obtain soundness and completeness results.

The paper proposes an extension of the definition of a canonical proof, central to proof-theoretic semantics, to a definition of a canonical derivation from open assumptions. The impact of the extension on the definition of (reified) proof-theoretic meaning of logical constants is discussed. The extended definition also sheds light on a puzzle regarding the definition of local-completeness of a natural-deduction proof-system, underlying its harmony.

Hedgehog (Hh) signaling is a widely studied signaling pathway because of its critical roles during development and in cell homeostasis. Vertebrate canonical and non‐canonical Hh signaling are typically assumed to be distinct and occur in different cellular compartments. While research has primarily focused on the canonical form of Hh signaling and its dependency on primary cilia – microtubule‐based signaling hubs – an extensive list of crucial functions mediated by non‐canonical Hh signaling has emerged. Moreover, amounting evidence (...) indicates that canonical and non‐canonical modes of Hh signaling are interlinked, and that they can overlap spatially, and in many cases interact functionally. Here, we discuss some of the many cellular effects of non‐canonical signaling and discuss new evidence indicating inter‐relationships with canonical signaling. We discuss how Smoothened (Smo), a key component of the Hh pathway, might coordinate such diverse downstream effects. Collectively, pursuit of questions such as those proposed here will aid in elucidating the full extent of Smo function in development and advance its use as a target for cancer therapeutics. (shrink)

Given a theoryTextending that of dense linear orders without endpoints, in a language ℒ ⊇ {<}, we are interested in extensionsT′ ofTin languages extending ℒ by unary relation symbols that are each interpreted in models ofT′ as sets that are both dense and codense in the underlying sets of the models.There is a canonically “wild” example, namelyT= Th andT′ = Th. Recall thatTis o-minimal, and so every open set definable in any model ofThas only finitely many definably connected components. But (...) it is well known that 〈ℝ, <, +, · ℚ 〉 defines every real Borel set, in particular, every open subset of any finite cartesian power of ℝ and every subset of any finite cartesian power of ℚ. To put this another way, the definable open sets in models ofTare essentially as simple as possible, whileT′ has a model where the definable open sets are as complicated as possible, as is the structure induced on the new predicate.In contrast to the preceding example, if ℝalgis the set of real algebraic numbers andT′ Th, then no model ofT′ defines any open set that is not definable in the underlying model ofT. (shrink)

In this paper we characterize, classify and axiomatize all axiomatic extensions of the IMT3 logic. This logic is the axiomatic extension of the involutive monoidal t-norm logic given by ¬φ3 ∨ φ. For our purpose we study the lattice of all subvarieties of the class IMT3, which is the variety of IMTL-algebras given by the equation ¬(x 3) ∨ x ≈ ⊤, and it is the algebraic counterpart of IMT3 logic. Since every subvariety of IMT3 is generated by their (...) totally ordered members, we study the structure of all IMT3-chains in order to determine the lattice of all subvarieties of IMT3. Given a family of IMT3-chains the number of elements of the largest odd finite subalgebra in the family and the number of elements of the largest even finite subalgebra in the family turns out to be a complete classifier of the variety generated. We obtain a canonical set of generators and a finite equational axiomatization for each subvariety and, for each corresponding logic, a finite set of characteristic matrices and a finite set of axioms. (shrink)

This paper is devoted to the complete axiomatization of dynamic extensions of arrow logic based on a restriction of propositional dynamic logic with intersection. Our deductive systems contain an unorthodox inference rule: the inference rule of intersection. The proof of the completeness of our deductive systems uses the technique of the canonical model.

We show that there exist 2 ℵ 0 equational classes of Boolean algebras with operators that are not generated by the complex algebras of any first-order definable class of relational structures. Using a variant of this construction, we resolve a long-standing question of Fine, by exhibiting a bimodal logic that is valid in its canonical frames, but is not sound and complete for any first-order definable class of Kripke frames (a monomodal example can then be obtained using simulation results (...) of Thomason). The constructions use the result of Erd $\H{o}$ s that there are finite graphs with arbitrarily large chromatic number and girth. (shrink)

Sahlqvist formulas are a syntactically specified class of modal formulas proposed by Hendrik Sahlqvist in 1975. They are important because of their first-order definability and canonicity, and hence axiomatize complete modal logics. The first-order properties definable by Sahlqvist formulas were syntactically characterized by Marcus Kracht in 1993. The present paper extends Kracht's theorem to the class of ‘generalized Sahlqvist formulas' introduced by Goranko and Vakarelov and describes an appropriate generalization of Kracht formulas.

The procedures of canonical quantization of the gravitational field apparently lead to entities for which any interpretation in terms of spatio-temporal localization or spatio-temporal extension seems difficult. This fact is the main ground for the suggestion that can often be found in the physics literature on canonical quantum gravity according to which spacetime may not be fundamental in some sense. This paper aims to investigate this radical suggestion from an ontologically serious point of view in the cases (...) of two standard forms of canonical quantum gravity, quantum geometrodynamics and loop quantum gravity. We start by discussing the physical features of the quantum wave functional of quantum geometrodynamics and of the spin networks of loop quantum gravity that motivate the view according to which spacetime is not fundamental. We then point out that, by contrast, for any known ontologically serious understanding of quantum entanglement, the commitment to spacetime seems indispensable. Against this background, we then critically discuss the idea that spacetime may emerge from more fundamental entities. As a consequence, we finally suggest that the emergence of classical spacetime in canonical quantum gravity faces a dilemma: either spacetime ontologically emerges from more fundamental non-spatio-temporal entities or it already belongs to the fundamental quantum gravitational level and the emergence of the classical picture is merely a matter of levels of description. On the first horn of the dilemma, it is unclear how to make sense of concrete physical entities that are not in spacetime and of the notion of ontological emergence that is involved. The second horn runs into the difficulties raised by the physics of canonical quantum gravity. (shrink)

The procedures of canonical quantization of the gravitational field apparently lead to entities for which any interpretation in terms of spatio-temporal localization or spatio-temporal extension seems difficult. This fact is the main ground for the suggestion that can often be found in the physics literature on canonical quantum gravity according to which spacetime may not be fundamental in some sense. This paper aims to investigate this radical suggestion from an ontologically serious point of view in the cases (...) of two standard forms of canonical quantum gravity, quantum geometrodynamics and loop quantum gravity. We start by discussing the physical features of the quantum wave functional of quantum geometrodynamics and of the spin networks of loop quantum gravity that motivate the view according to which spacetime is not fundamental. We then point out that, by contrast, for any known ontologically serious understanding of quantum entanglement, the commitment to spacetime seems indispensable. Against this background, we then critically discuss the idea that spacetime may emerge from more fundamental entities. As a consequence, we finally suggest that the emergence of classical spacetime in canonical quantum gravity faces a dilemma: either spacetime ontologically emerges from more fundamental non-spatio-temporal entities or it already belongs to the fundamental quantum gravitational level and the emergence of the classical picture is merely a matter of levels of description. On the first horn of the dilemma, it is unclear how to make sense of concrete physical entities that are not in spacetime and of the notion of ontological emergence that is involved. The second horn runs into the difficulties raised by the physics of canonical quantum gravity. (shrink)

This article extends the combinatorial approach to support the determination of contextuality amidst causal influences. Contextuality is an active field of study in Quantum Cognition, in systems relating to mental phenomena, such as concepts in human memory. In the cognitive field of study, a contemporary challenge facing the determination of whether a phenomenon is contextual has been the identification and management of disturbances. Whether or not said disturbances are identified through the modeling approach, constitute causal influences, or are disregardableas as (...) noise is important, as contextuality cannot be adequately determined in the presence of causal influences. To address this challenge, we first provide a formalization of necessary elements of the combinatorial approach within the language of canonical causal models. Through this formalization, we extend the combinatorial approach to support a measurement and treatment of disturbance, and offer techniques to separately distinguish noise and causal influences. Thereafter, we develop a protocol through which these elements may be represented within a cognitive experiment. As human cognition seems rife with causal influences, cognitive modelers may apply the extended combinatorial approach to practically determine the contextuality of cognitive phenomena. (shrink)

Rho GTPases are critically important and are centrally positioned regulators of the actomyosin cytoskeleton. By influencing the organization and architecture of the cytoskeleton, Rho proteins play prominent roles in many cellular processes including adhesion, migration, intra‐cellular transportation, and proliferation. The most important method of Rho GTPase regulation is via the GTPase cycle; however, post‐translational modifications (PTMs) also play critical roles in Rho protein regulation. Relative to other PTMs such as lipidation or phosphorylation that have been extensively characterized, protein oxidation is (...) a regulatory PTM that has been poorly studied. Protein oxidation primarily occurs from the reaction of reactive oxygen species (ROS), such as hydrogen peroxide (H2O2), with amino acid side chain thiols on cysteine (Cys) and methionine (Met) residues. The versatile redox modifications of cysteine residues exemplify their integral role in cell signalling processes. Here we review prominent members of the Rho GTPase family and discuss how lipidation, phosphorylation, and oxidation on conserved cysteine residues affects their regulation and function. (shrink)

There exist two known types of ultrafilter extensions of first-order models, both in a certain sense canonical. One of them comes from modal logic and universal algebra, and in fact goes back to Jónsson and Tarski :891–939, 1951; 74:127–162, 1952). Another one The infinity project proceeding, Barcelona, 2012) comes from model theory and algebra of ultrafilters, with ultrafilter extensions of semigroups as its main precursor. By a classical fact of general topology, the space of ultrafilters over a discrete space (...) is its largest compactification. The main result of Saveliev The infinity project proceeding, Barcelona, 2012), which confirms a canonicity of this extension, generalizes this fact to discrete spaces endowed with an arbitrary first-order structure. An analogous result for the former type of ultrafilter extensions was obtained in Saveliev. Results of such kind are referred to as extension theorems. After a brief introduction, we offer a uniform approach to both types of extensions based on the idea to extend the extension procedure itself. We propose a generalization of the standard concept of first-order interpretations in which functional and relational symbols are interpreted rather by ultrafilters over sets of functions and relations than by functions and relations themselves, and define ultrafilter models with an appropriate semantics for them. We provide two specific operations which turn ultrafilter models into ordinary models, establish necessary and sufficient conditions under which the latter are the two canonical ultrafilter extensions of some ordinary models, and obtain a topological characterization of ultrafilter models. We generalize a restricted version of the extension theorem to ultrafilter models. To formulate the full version, we propose a wider concept of ultrafilter models with their semantics based on limits of ultrafilters, and show that the former concept can be identified, in a certain way, with a particular case of the latter; moreover, the new concept absorbs the ordinary concept of models. We provide two more specific operations which turn ultrafilter models in the narrow sense into ones in the wide sense, and establish necessary and sufficient conditions under which ultrafilter models in the wide sense are the images of ones in the narrow sense under these operations, and also are two canonical ultrafilter extensions of some ordinary models. Finally, we establish three full versions of the extension theorem for ultrafilter models in the wide sense. The results of the first three sections of this paper were partially announced in Poliakov and Saveliev On two concepts of ultrafilter extensions of first-order models and their generalizations, Springer, Berlin, 2017). (shrink)

In different papers, Carnielli, W. & Rodrigues, A., Carnielli, W. Coniglio, M. & Rodrigues, A. and Rodrigues & Carnielli, present two logics motivated by the idea of capturing contradictions as conflicting evidence. The first logic is called BLE and the second—that is a conservative extension of BLE—is named LETJ. Roughly, BLE and LETJ are two non-classical logics in which the Laws of Explosion and Excluded Middle are not admissible. LETJ is built on top of BLE. Moreover, LETJ is a (...) Logic of Formal Inconsistency. This means that there is an operator that, roughly speaking, identifies a formula as having classical behavior. Both systems are motivated by the idea that there are different conditions for accepting or rejecting a sentence of our natural language. So, there are some special introduction and elimination rules in the theory that are capturing different conditions of use. Rodrigues & Carnielli’s paper has an interesting and challenging idea. According to them, BLE and LETJ are incompatible with dialetheia. It seems to show that these paraconsistent logics cannot be interpreted using truth-conditions that allow true contradictions. In short, BLE and LETJ talk about conflicting evidence avoiding to talk about gluts. I am going to argue against this point of view. Basically, I will firstly offer a new interpretation of BLE and LETJ that is compatible with dialetheia. The background of my position is to reject the one canonical interpretation thesis: the idea according to which a logical system has one standard interpretation. Then, I will secondly show that there is no logical basis to fix that Rodrigues & Carnielli’s interpretation is the canonical way to establish the content of logical notions of BLE and LETJ. Furthermore, the system LETJ captures inside classical logic. Then, I am also going to use this technical result to offer some further doubts about the one canonical interpretation thesis. (shrink)

We use the apparatus of the canonical formulas introduced by Zakharyaschev [10] to prove that all finitely axiomatizable normal modal logics containing K4.3 are decidable, though possibly not characterized by classes of finite frames. Our method is purely frame-theoretic. Roughly, given a normal logic L above K4.3, we enumerate effectively a class of frames with respect to which L is complete, show how to check effectively whether a frame in the class validates a given formula, and then apply a (...) Harropstyle argument to establish the decidability of L, provided of course that it has finitely many axioms. (shrink)

For each intermediate propositional logicJ, J * denotes the least predicate extension ofJ. By the method of canonical models, the strongly Kripke completeness ofJ *+D(=x(p(x)q)xp(x)q) is shown in some cases including:1. J is tabular, 2. J is a subframe logic. A variant of Zakharyashchev's canonical formulas for intermediate logics is introduced to prove the second case.

The previously introduced algorithm \sqema\ computes first-order frame equivalents for modal formulae and also proves their canonicity. Here we extend \sqema\ with an additional rule based on a recursive version of Ackermann's lemma, which enables the algorithm to compute local frame equivalents of modal formulae in the extension of first-order logic with monadic least fixed-points \mffo. This computation operates by transforming input formulae into locally frame equivalent ones in the pure fragment of the hybrid mu-calculus. In particular, we prove (...) that the recursive extension of \sqema\ succeeds on the class of `recursive formulae'. We also show that a certain version of this algorithm guarantees the canonicity of the formulae on which it succeeds. (shrink)

In a previous work we introduced the algorithm \SQEMA\ for computing first-order equivalents and proving canonicity of modal formulae, and thus established a very general correspondence and canonical completeness result. \SQEMA\ is based on transformation rules, the most important of which employs a modal version of a result by Ackermann that enables elimination of an existentially quantified predicate variable in a formula, provided a certain negative polarity condition on that variable is satisfied. In this paper we develop several extensions (...) of \SQEMA\ where that syntactic condition is replaced by a semantic one, viz. downward monotonicity. For the first, and most general, extension \SSQEMA\ we prove correctness for a large class of modal formulae containing an extension of the Sahlqvist formulae, defined by replacing polarity with monotonicity. By employing a special modal version of Lyndon's monotonicity theorem and imposing additional requirements on the Ackermann rule we obtain restricted versions of \SSQEMA\ which guarantee canonicity, too. (shrink)

ABSTRACT The emerging discourse concerning the desirability of intervention in senescence to achieve radical life extension for persons has featured some striking blurring in traditional liberal and conservative commitments and positions. This affords an opportunity for re‐evaluation of these same. The canonical conservative view of the intrinsic value of life is re‐examined and found primarily to involve a denial of human prerogative, rather than an active underwriting of the value of life extension. A critique is offered of (...) an attempted argument against aging intervention from a proto‐conservative worry about a purported threat to human nature. Immortality is found to be a red herring, but a revealing one. Further, the classic liberal view is examined and found wanting in terms of the gravity of its own commitment to, and fullness of its account of the value of life, and the value of life extension. An analysis of the liberal conception of personhood is proposed that both defines persons necessarily as processes, and demonstrates the inalienable quality of the value of life extension to persons so defined. (shrink)

v. 1. Proceedings, Rome, 2001-2004 -- v. 2. Giornate di studi, 2005-2008.

This article is a discussion of the critical remarks raised by Kristian Bankov in a notion called Bankov’s razor, about some foundational elements of the biosemiotic paradigm. The elaborated form of the “razor” includes three main questions on biosemiotic ideas, namely: 1) the philosophical grounds of the biosemiotic discourse, 2) the scientific output of biosemiotics, and 3) the ethical consequences of some biosemiotic presumptions (this latter, given its scopes and extension, is left for a future occasion). Such questions are (...) commented and challenged by Dario Martinelli, from a point of view that is primarily that of the zoosemiotician, therefore an insider of biosemiotics. In order to set the readers’ expectations in the right direction, it shall perhaps be fair to inform them that the style of the article is rather sui generis, and can hardly be classified within the genre of academic essays. Tones and terminology are more reminiscent of a philosophical pamphlet written in dialogical form. Hopefully, this choice will not compromise the scientific content of the article. (shrink)

There has been a recent interest in hierarchical generalizations of classic incompleteness results. This paper provides evidence that such generalizations are readily obtainable from suitably formulated hierarchical versions of the principles used in the original proofs. By collecting such principles, we prove hierarchical versions of Mostowski’s theorem on independent formulae, Kripke’s theorem on flexible formulae, Woodin’s theorem on the universal algorithm, and a few related results. As a corollary, we obtain the expected result that the formula expressing “$\mathrm {T}$is$\Sigma _n$-ill” (...) is a canonical example of a$\Sigma _{n+1}$formula that is$\Pi _{n+1}$-conservative over$\mathrm {T}$. (shrink)