Although the computational properties of the Region Connection Calculus RCC-8 are well studied, reasoning with RCC-8 entails several representational problems. This includes the problem of representing arbitrary spatial regions in a computational framework, leading to the problem of generating a realization of a consistent set of RCC-8 constraints. A further problem is that RCC-8 performs reasoning about topological space, which does not have a particular dimension. Most applications of spatial reasoning, however, deal with two- or three-dimensional space. Therefore, a consistent (...) set of RCC-8 constraints might not be realizable within the desired dimension. In this paper we address these problems and develop a canonical model of RCC-8 which allows a simple representation of regions with respect to a set of RCC-8 constraints, and, further, enables us to generate realizations in any dimension d = 1. For three-and higher-dimensional space this can also be done for internally connected regions. (shrink)

We prove the canonical models introduced in [D] do not exist for some graded normal logics with symmetric models, namelyKB°, KBD°, KBT°, so that we define a new kind of canonical models, the general ones, and show they exist and work well in every case.

We define the property of Π2-compactness of a statement Φ of set theory, meaning roughly that the hard core of the impact of Φ on combinatorics of 1 can be isolated in a canonical model for the statement Φ. We show that the following statements are Π2-compact: “dominating NUMBER = 1,” “cofinality of the meager IDEAL = 1”, “cofinality of the null IDEAL = 1”, “bounding NUMBER = 1”, existence of various types of Souslin trees and variations on (...) uniformity of measure and CATEGORY = 1. Several important new metamathematical patterns among classical statements of set theory are pointed out. (shrink)

We introduce Kripke models for propositional substructural logics with strong negation, and show the completeness theorems for these logics using an extended Ishihara's canonical model construction method. The framework presented can deal with a broad range of substructural logics with strong negation, including a modified version of Nelson's logic N$^-$, Wansing's logic COSPL, and extended versions of Visser's basic propositional logic, positive relevant logics, Corsi's logics and M\'endez's logics.

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.

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.

This work intends to be a generalization and a simplification of the techniques employed in [2], by the proposal of a general strategy to prove satisfiability theorems for NLGM-s (= normal logics with graded modalities), analogously to the well known technique of the canonical models by Lemmon and Scott for classical modal logics.

In this paper we investigate Kripke models, used to model knowledge or belief in a static situation, and action models, used to model communicative actions that change this knowledge or belief. The appropriate notion for structural equivalence between modal structures such as Kripke models is bisimulation: Kripke models that are bisimilar are modally equivalent. We would like to find a structural relation that can play the same role for the action models that play a prominent role in information (...) updating. Two action models are equivalent if they yield the same results when updating Kripke models. More precisely, two action models are equivalent if it holds for all Kripke models that the result of updating with one action model is bisimilar to the result of updating with the other action model. We propose a new notion of action emulation that characterizes the structural equivalence of the important class of canonical action models. Since every action model has an equivalent canonical action model, this gives a method to decide the equivalence of any pair of action models. We also give a partial result that holds for the class of all action models. Our results extend the work in van Eijck et al. (Synthese 185(1):131–151, 2012). (shrink)

In their presentation of canonical models for normal systems of modal logic, Hughes and Cresswell observe that some of these models are based on a frame which can be also thought of as a collection of two or more isolated frames; they call such frames ‘non-cohesive’. The problem of checking whether the canonical model of a given system is cohesive is still rather unexplored and no general decision procedure is available. The main contribution of this article consists (...) in introducing a method which is sufficient to show that canonical models of some relevant classes of normal monomodal and bimodal systems are always non-cohesive. (shrink)

In a recent paper, Kaplan (Synthese 183:339–373, 2011) takes up the task of extending Craver’s (Explaining the brain, 2007) mechanistic account of explanation in neuroscience to the new territory of computational neuroscience. He presents the model to mechanism mapping (3M) criterion as a condition for a model’s explanatory adequacy. This mechanistic approach is intended to replace earlier accounts which posited a level of computational analysis conceived as distinct and autonomous from underlying mechanistic details. In this paper I discuss (...) work in computational neuroscience that creates difficulties for the mechanist project. Carandini and Heeger (Nat Rev Neurosci 13:51–62, 2012) propose that many neural response properties can be understood in terms of canonical neural computations. These are “standard computational modules that apply the same fundamental operations in a variety of contexts.” Importantly, these computations can have numerous biophysical realisations, and so straightforward examination of the mechanisms underlying these computations carries little explanatory weight. Through a comparison between this modelling approach and minimal models in other branches of science, I argue that computational neuroscience frequently employs a distinct explanatory style, namely, efficient coding explanation. Such explanations cannot be assimilated into the mechanistic framework but do bear interesting similarities with evolutionary and optimality explanations elsewhere in biology. (shrink)

This paper obtains the weak completeness and decidability results for standard systems of modal logic using models built from formulas themselves. This line of work began with Fine (Notre Dame J. Form. Log. 16:229-237, 1975). There are two ways in which our work advances on that paper: First, the definition of our models is mainly based on the relation Kozen and Parikh used in their proof of the completeness of PDL, see (Theor. Comp. Sci. 113-118, 1981). The point is to (...) develop a general model-construction method based on this definition. We do this and thereby obtain the completeness of most of the standard modal systems, and in addition apply the method to some other systems of interest. None of the results use filtration, but in our final section we explore the connection. (shrink)

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.

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)

Related Works: Part I: Michael Zakharyaschev. Canonical Formulas for $K4$. Part I: Basic Results. J. Symbolic Logic, Volume 57, Issue 4 , 1377--1402. Project Euclid: euclid.jsl/1183744119 Part II: Michael Zakharyaschev. Canonical Formulas for K4. Part II: Cofinal Subframe Logics. J. Symbolic Logic, Volume 61, Issue 2 , 421--449. Project Euclid: euclid.jsl/1183745008.

We investigate the role of coalgebraic predicate logic, a logic for neighborhood frames first proposed by Chang, in the study of monotonic modal logics. We prove analogues of the Goldblatt–Thomason theorem and Fine’s canonicity theorem for classes of monotonic neighborhood frames closed under elementary equivalence in coalgebraic predicate logic. The elementary equivalence here can be relativized to the classes of monotonic, quasi-filter, augmented quasi-filter, filter, or augmented filter neighborhood frames, respectively. The original, Kripke-semantic versions of the theorems follow as a (...) special case concerning the classes of augmented filter neighborhood frames. (shrink)

Related Works: Part I: Michael Zakharyaschev. Canonical Formulas for $K4$. Part I: Basic Results. J. Symbolic Logic, Volume 57, Issue 4, 1377--1402. Project Euclid: euclid.jsl/1183744119 Part II: Michael Zakharyaschev. Canonical Formulas for K4. Part II: Cofinal Subframe Logics. J. Symbolic Logic, Volume 61, Issue 2, 421--449. Project Euclid: euclid.jsl/1183745008.

Introduction. Judgments on church authority have been transformed depending on the changing posi- tion of the Church in society and its relationship with the state. In the process of rethinking, there have developed special traditions of its understand- ing, which reflected the specifics of the existence of Christian communities in different cultural and legal conditions. The purpose of the study is to outline the traditions of understanding church authority in three Christian denominations and offer grounds for their comparison in the (...) philosophical and canonical aspect. Methods. A comparative method is used on the basis of analyzing philosophical literature and canon-legal sources. Scientific novelty of the research. The article for the first time systematizes confessional differences in interpreting the form, content and levels of church authority. Results. It is shown that the decisive factor de- termining the differences between confessional traditions in the understanding of church authority is the nature of the boundary between the sacred and government authorities. Catholicism, consider- ing the governmental power established by God, includes it in the sacred, along with the teaching and sacramental. Protestantism, on the contrary, radically opposes it to the sacred, recognizing it as the prerogative of the state. Orthodoxy, as a rule, does not recognize government power as sacred, but it does not separate it from the church. Conclusions. An analysis of the positions ex- pressed by representatives of various Christian denominations regarding church authority makes it possible for us to conclude that the Orthodox tradi- tion tends to defend a position equidistant from polar opinions. (shrink)

Sufficient syntactic conditions for canonicity in intermediate and intuitionistic modal logics are given. We present a new technique which does not require semantic first-order reduction and which is constructive in the sense that it works in an intuitionistic metatheory through a model without points which is classically isomorphic to the usual canonical model.

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)

Related Works: Part I: Michael Zakharyaschev. Canonical Formulas for $K4$. Part I: Basic Results. J. Symbolic Logic, Volume 57, Issue 4 , 1377--1402. Project Euclid: euclid.jsl/1183744119 Part III: Michael Zakharyaschev. Canonical Formulas for K4. Part III: The Finite Model Property. J. Symbolic Logic, Volume 62, Issue 3 , 950--975. Project Euclid: euclid.jsl/1183745306.

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)

This paper addresses a fundamental line of research in neuroscience: the identification of a putative neural processing core of the cerebral cortex, often claimed to be “canonical”. This “canonical” core would be shared by the entire cortex, and would explain why it is so powerful and diversified in tasks and functions, yet so uniform in architecture. The purpose of this paper is to analyze the search for canonical explanations over the past 40 years, discussing the theoretical frameworks (...) informing this research. It will highlight a bias that, in my opinion, has limited the success of this research project, that of overlooking the dimension of cortical development. The earliest explanation of the cerebral cortex as canonical was attempted by David Marr, deriving putative cortical circuits from general mathematical laws, loosely following a deductive-nomological account. Although Marr’s theory turned out to be incorrect, one of its merits was to have put the issue of cortical circuit development at the top of his agenda. This aspect has been largely neglected in much of the research on canonical models that has followed. Models proposed in the 1980s were conceived as mechanistic. They identified a small number of components that interacted as a basic circuit, with each component defined as a function. More recent models have been presented as idealized canonical computations, distinct from mechanistic explanations, due to the lack of identifiable cortical components. Currently, the entire enterprise of coming up with a single canonical explanation has been criticized as being misguided, and the premise of the uniformity of the cortex has been strongly challenged. This debate is analyzed here. The legacy of the canonical circuit concept is reflected in both positive and negative ways in recent large-scale brain projects, such as the Human Brain Project. One positive aspect is that these projects might achieve the aim of producing detailed simulations of cortical electrical activity, a negative one regards whether they will be able to find ways of simulating how circuits actually develop. (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)

We study complex phenomena arising from a simple optimal choice consumer model, starting from the classical framework in Benhabib and Day :459–471, 1981). We introduce elements of increasing complexity and we investigate their effects on the resulting social behaviors. The dynamics introduce the dependence of current preferences on past consumers actions. A non-monotone updating preference function allows us to obtain a threshold effect, according to which the agents adopt a bandwagon/snob behavior if the preferences are below/above a certain saturation (...) level. We consider homogeneous and heterogeneous agents and we introduce local/global interaction when they are spatially distributed. We show through simulations several phenomena which are absent in the classical model and which reproduce significant social behaviors, such as path dependence, coexistence of different periodic and chaotic attractors, emergence of spatial patterns. (shrink)

Get the very most out of your Canon PowerShot G11 camera. Now that you've got a new Canon PowerShot G11 10.0 megapixel digital camera, take this handy book along to help you tap all the tricks and features that your cool new camera has to offer. Canon PowerShot G11 Digital Field Guide, sized perfectly to fit in your camera bag, includes pages of step-by-step techniques, beautiful full-color examples, and professional tips sure to help you capture exactly the images you want. (...) Understand all the technology your new camera has to offer—such as new face recognition software, a 5x optical zoom, faster electronics, and much more—with this step-by-step guide. It's so handy, you can check for tips while you're shooting! Provides no-fail techniques for getting the most out of your Canon PowerShot G11 digital camera Walks you through the PowerShot G11's new features and functions, including face recognition software, 5x optical zoom, RAW image format capture, a wider aperture than standard PowerShot models, faster electronics, and remote capture Elevates your photography skills to a new level with photography secrets from professional photographer and author Charlotte Lowrie Teaches you photography essentials and offers beautiful, full-color examples to inspire you on your next shoot Move from standard shots to power shots with Canon PowerShot G11 Digital Field Guide. (shrink)

In a recent article in Analysis, Graeme Hunter and William Seager (1981) attempt to rescue counterpart theory (CT) from some objections of Hazen 1979. They see these objections as arising from ‘uncritical use of the translation scheme originally proposed by Lewis’, and intend to meet them by refraining from use of that scheme. But they do not offer a new scheme; they say ‘…it is no more necessary to have one to capture the sense of modal idiom than it is (...) to capture the sense of quantificational idiom…Appeal to truth value is the single most important criterion of correct translation’ (Hunter and Seager 1981:72). Thus, where the scheme of Lewis (1968) translates a truth by a falsehood or conversely, Hunter and Seager simply produce a sentence which they claim to be a better translation, without articulating any structural principles they employ to arrive at their candidate. A friend of CT should not be happy with this procedure. Let Lm be first-order modal language and Lc be the language of counterpart theory. Sentences of Lc are intended to interpret or elucidate the meanings of Lm-sentences in the strong sense that they should be the outputs of an adequate theory of meaning, which we can formulate as a model theory, for Lm, written in Lc plus set theory. The interest of CT resides in its potential to provide an alternative approach to the model theory of modal logic, and from the clauses of any such alternative model theory we should be able to read off a translation scheme for Lm into Lc, just as we can in the standard case. If CT’s motivation is sound, which Hunter and Seager do not dispute, yet there is no translation scheme and so no counterpart-theoretic model theory, one might suspect some defect in the original language Lm. And in fact, Hunter and Seager find certain Lm-sentences multiply ambiguous with respect to Lc; but if a counterpart-theoretic model theory is possible, to say.. (shrink)

Propositional dynamic logic is complete but not compact. As a consequence, strong completeness requires an infinitary proof system. In this paper, we present a short proof for strong completeness of $$\mathsf{PDL}$$ relative to an infinitary proof system containing the rule from [α; β n ]φ for all $$n \in {\mathbb{N}}$$, conclude $$[\alpha;\beta^*] \varphi$$. The proof uses a universal canonical model, and it is generalized to other modal logics with infinitary proof rules, such as epistemic knowledge with common knowledge. (...) Also, we show that the universal canonical model of $$\mathsf{PDL}$$ lacks the property of modal harmony, the analogue of the Truth lemma for modal operators. (shrink)

This paper consists of three parts supplementing the papers of K. Hauser 2002 and D. Mumford 2000: There exist regular open sets of points in with paradoxical properties, which are constructed without using the axiom of choice or the continuum hypothesis. There exist canonical universes of sets in which one can define essentially all objects of mathematical analysis and in which all our intuitions about probabilities are true. Models satisfying the full axiom of choice cannot satisfy all those intuitions (...) and they violate them in a very similar way as those models which satisfy also the continuum hypothesis. (shrink)

Assuming the existence of ω compact cardinals in a model on GCH, we prove the consistency of some new canonization properties on ω. Our aim is to get as dense patterns in the distribution of indiscernibles as possible. We prove Theorem 2.1. thm2.1Suppose the consistency of “ZFC+GCH + there are infinitely many compact cardinals”. Then the following is consistent: ZFC+GCH + and for every family 0 (...) Sn,0shrink)

The ‘messianic’ is one of philosophy’s most appropriated religious terms, yet one apparently now bereft of its historical religious particularity. This essay thus explores a genealogical approach to the ‘messianic’ which might prove helpful in uncovering the reasons for this transformation from the theological to the philosophical, and what role, if any, theology still has in determining the meaning and usage of this term. Accordingly, this essay traces the term through the work of Walter Benjamin, Jacques Derrida and Giorgio Agamben. (...) This development is made against the backdrop of another religious term which indirectly pervades the work of all three authors: the canon. The canonical is a term which lingers on the margins of these messianic discourses and needs to be explored further in the context of this work in order to provide a fitting foil to these otherwise ‘purely philosophical’ developments of the messianic. The necessity for invoking the canonical form will become clear as this analysis is extended to the work of Agamben in order to determine how canons remain an unstated factor in his attempt to eradicate all representation from a just ethical paradigm. In this attempt to articulate a model of understanding that goes beyond the universal/particular divide, he will in fact advance a movement from particularity to particularity which can be profoundly read as a genuine paradigm for articulating a theological principle of creation. Thus, this essay intends to point toward two related conclusions: first, that the triad of canon-creation-representation might be understood as a necessity for cultural intelligibility, yet one that must also be seen in relation to its messianic-redemptive-unrepresented elements; and, second, that even this epistemological framework can be undone through a bid to end all representations which nonetheless allows us to return to a more profound realization of creation. (shrink)

This paper looks at the concept of neighborhood canonicity introduced by BRIAN CHELLAS [2]. We follow the lead of the author's paper [9] where it was shown that every non-iterative logic is neighborhood canonical and here we will show that all logics whose axioms have a simple syntactic form-no intensional operator is in boolean combination with a propositional letter-and which have the finite model property are neighborhood canonical. One consequence of this is that KMcK, the McKinsey logic, (...) is neighborhood canonical, an interesting counterpoint to the results of ROBERT GOLDBLATT and XIAOPING WANG who showed, respectively, that KMcK is not relational canonical [5] and that KMcK is not relationally strongly complete [11]. (shrink)

We have previously argued that historical cases must be rendered canonical before they can plausibly serve as evidence for philosophical claims, where canonicity is established through a process of negotiation among historians and philosophers of science (Bolinska and Martin, 2020). Here, we extend this proposal by exploring how that negotiation might take place in practice. The working stock of historical examples that philosophers tend to employ has long been established informally, and, as a result, somewhat haphazardly. The composition of (...) the historical canon of philosophy of science is therefore path dependent, and cases often become stock examples for reasons tangential to their appropriateness for the purposes at hand. We show how the lack of rigor around the canonization of case studies has muddied the waters in selected philosophical debates. This, in turn, lays the groundwork for proposing ways in which they can be improved. (shrink)

We show that any (atomic) excellent class K can be expanded with hyperimaginaries to form an (atomic) excellent class Keq which has canonical bases. When K is, in addition, of finite U-rank, then Keq is also simple and has a full canonical bases theorem. This positive situation contrasts starkly with homogeneous model theory for example, where the eq-expansion may fail to be homogeneous. However, this paper shows that expanding an ω-stable, homogeneous class K gives rise to an (...) excellent class, which is simple if K is of finite U-rank. (shrink)

Our main results are:Theorem 1. Con implies Con. [In fact equiconsistency holds.]Theorem 3. Con implies Con.Theorem 5. Con ”) implies Con.We start with a discussion of the canonical functions and look at some combinatorial principles. Assuming the domination property of Theorem 1, we use the Ketonen diagram to show that ω2V is a limit of measurable cardinals in Jensen’s core model KMO for measures of order zero. Using related arguments we show that ω2V is a stationary limit of (...) measurable cardinals in KMO, if there exists a weakly normal ultrafilter on ω1. The proof yields some other results, e.g., on the consistency strength of weak*-saturated filters on ω1, which are of interest in view of the classical Ulam problem. (shrink)

We study the notion of weak canonical bases in an NSOP $_{1}$ theory T with existence. Given $p=\operatorname {tp}$ where $B=\operatorname {acl}$ in ${\mathcal M}^{\operatorname {eq}}\models T^{\operatorname {eq}}$, the weak canonical base of p is the smallest algebraically closed subset of B over which p does not Kim-fork. With this aim we firstly show that the transitive closure $\approx $ of collinearity of an indiscernible sequence is type-definable. Secondly, we prove that given a total $\mathop {\smile \hskip -0.9em (...) ^| \ }^K$ -Morley sequence I in p, the weak canonical base of $\operatorname {tp}$ is $\operatorname {acl}$, if the hyperimaginary $I/\approx $ is eliminable to e, a sequence of imaginaries. We also supply a couple of criteria for when the weak canonical base of p exists. In particular the weak canonical base of p is the intersection of the weak canonical bases of all total $\mathop {\smile \hskip -0.9em ^| \ }^K$ -Morley sequences in p over B. However, while we investigate some examples, we point out that given two weak canonical bases of total $\mathop {\smile \hskip -0.9em ^| \ }^K$ -Morley sequences in p need not be interalgebraic, contrary to the case of simple theories. Lastly we suggest an independence relation relying on weak canonical bases, when T has those. The relation, satisfying transitivity and base monotonicity, might be useful in further studies on NSOP $_1$ theories. (shrink)

This paper looks at the concept of neighborhood canonicity introduced by BRIAN CHELLAS [2]. We follow the lead of the author's paper [9] where it was shown that every non-iterative logic is neighborhood canonical and here we will show that all logics whose axioms have a simple syntactic form-no intensional operator is in boolean combination with a propositional letter-and which have the finite model property are neighborhood canonical. One consequence of this is that KMcK, the McKinsey logic, (...) is neighborhood canonical, an interesting counterpoint to the results of ROBERT GOLDBLATT and XIAOPING WANG who showed, respectively, that KMcK is not relational canonical [5] and that KMcK is not relationally strongly complete [11]. (shrink)

For many centuries, heroic virtue has been for the Congregation of the Causes of the Saints the golden rule to assess sanctity. It was Prospero Lambertini who developed the criteria, setting an extremely high standard that at the same time fitted the various types and stages of human life. With the shift from admiration to imitation of the saints, new methods of studying their life became necessary. From the 20th century onwards, heroicity of virtue was defined by the Congregation in (...) terms not of unusual and extraordinary actions, but the constant and exact fulfilment of the duties of one’s state of life. Sanctity in the canonical sense, according to the Second Vatican Council, differs in degree and does not constitute a different species in the genus “good Catholic”. The new laws for beatification employ no longer the courtroom model, investigating separate virtues, but the academic model of researching and writing a doctoral dissertation, with the accent on a person’s spiritual growth. What makes the saints different from other Christians is their particularly focused passion; the real significance of their life, however, only becomes clear when it is over. It is then, too, that we can understand their specific mission and their meaning for the life of the Church, as tradition at its most living and models of holiness for their particular age. The study of the live of the saints , necessary to assess sanctity, needs its own method. Belonging as they do to a tradition that is essentially religious, the true image of the saints is best perceived by the light of faith. Hagiology cannot, however, ignore modern science. Not only does it depend on the material gathered by historians, it also needs history and psychology for its interpretation. The final judgment pertains to the Pope, or to be more precise, to the Spirit. (shrink)

We revisit the theory of amalgamation classes but we do not insist on staying within elementary classes.

We introduce and study some variants of a notion of canonical set theoretical truth. By this, we mean truth in a transitive proper class model M of ZFC that is uniquely characterized by some $$\in$$ ∈ -formula. We show that there are interesting statements that hold in all such models, but do not follow from ZFC, such as the ground model axiom and the nonexistence of measurable cardinals. We also study a related concept in which we only (...) require M to be fixed up to elementary equivalence. We show that this theory-canonicity also goes beyond provability in ZFC, but it does not rule out measurable cardinals and it does not fix the size of the continuum. (shrink)

The exciting world of HD video is in your hands Your Canon VIXIA HD camcorder delivers crisp video and still images with eye-catching, brilliant colors, enabling you to create amazing video works of art. To help you get all that your camcorder has to offer, this convenient, portable guide shows you how to use the various modes, settings, and features, but that's not all. It also provides an overview of videography fundamentals, then takes you into the field with advice on (...) using sound and light to their best advantage, editing your footage, choosing useful accessories, and more. Master the settings for VIXIA HD camcorder models HF10, HF11, HF100, HG10, HG20, and HG21, as well as HV20, HV30, and HR10. Experiment with exposure settings, white balance, image effects, zoom speed, and audio recording levels Learn more about developing a story, manipulating depth of field, composing shots, and protecting yourself with releases Transfer and edit your footage with iMovie® '09 or Pixela ImageMixer. (shrink)

Following Fine [3], p. 20, we say that a normal propositional modal logic is canonical i all its theorems are valid on the frame of its canonical model . In this paper we prove that K1:1, i.e. S4+ J1 L p) p is not canonical y . We say that two points x and y in a frame are co-accessible i xRy; yRx, but x =6 y. Our proof proceeds by showing that A. The canonical (...) model for K1:1 contains a pair of co-accessible points; and B. J1 is not valid on any frame with a pair of co-accessible points. Clearly our result follows immediately from A and B. (shrink)