The filtration method is often used to prove the finite model property of modal logics. We adapt this technique to the generalized Veltman semantics for interpretability logics. In order to preserve the defining properties of generalized Veltman models, we use bisimulations to define adequate filtrations. We give an alternative proof of the finite model property of interpretability logic with respect to Veltman models, and we prove the finite model property of the systems and with respect to generalized Veltman models.

This paper focuses on the question of filtration through the perspective of “too much information”. It concerns Western society within the context of new media and digital culture. The main aim of this paper is to apply a philosophical reading on the video game concept of Selection for Societal Sanity within the problematics of cultural filtration, control of behaviors and desire, and a problematization of trans-individuation that the selected narrative conveys. The idea of Selection for Societal Sanity, which (...) derives from the first postmodern video game Metal Gear Solid 2: Sons of Liberty (2001), is applied into a philosophical framework based on select concepts from Bernard Stiegler’s writing and incorporating them with current events such as post-truth or fake news in order to explore the role of techne and filtration within social organizations and individual psyches. Alternate forms of behavior, which contest cultural paradigms, are re-problematized as tension between calculability and incalculability, or market value versus social bonding. (shrink)

We show that it is consistent with ordinary set theory ZFC and the generalized continuum hypothesis that there exist two 1-separable abelian groups of cardinality 1 which are filtration-equivalent and one is a Whitehead group but the other is not. This solves one of the open problems from Eklof and Mekler [2].

I consider some different forms of filtration and raise some questions concerning the scope of the method of filtrations in propositional modal logic.

Filtration combustion is described by Laplacian growth without surface tension. These equations have elegant analytical solutions that replace the complex integro-differential motion equations by simple differential equations of pole motion in a complex plane. The main problem with such a solution is the existence of finite time singularities. To prevent such singularities, nonzero surface tension is usually used. However, nonzero surface tension does not exist in filtration combustion, and this destroys the analytical solutions. However, a more elegant approach (...) exists for solving the problem. First, we can introduce a small amount of pole noise to the system. Second, for regularisation of the problem, we throw out all new poles that can produce a finite time singularity. It can be strictly proved that the asymptotic solution for such a system is a single finger. Moreover, the qualitative consideration demonstrates that a finger with 1 2 of the channel width is statistically stable. Therefore, all properties of such a solution are exactly the same as those of the solution with nonzero surface tension under numerical noise. The solution of the ST problem without surface tension is similar to the solution for the equation of cellular flames in the case of the combustion of gas mixtures. (shrink)

The filtration method for proving decidability in a focused minimal manner is a highlight of modal logic, widely used, but also posing a bit of a challenge as to its scope and what makes it tick. In this paper, we bring together a number of modern perspectives on filtration, including model-theoretic and proof-theoretic ones. We also include a few more unusual recent connections with dynamic logics of model change and logics of questions and issues. Finally, we analyze where (...) the filtration method fails in full first-order logic, and what it still has to say there. (shrink)

The role played by continuous morphisms in propositional modal logic is investigated: it turns out that they are strictly related to filtrations and to suitable variants of the notion of a free algebra. We also employ continuous morphisms in incremental constructions of (standard) finitely generated free ????4-algebras.

ArgumentThe Uppsala school in separation science, under the leadership of Nobel laureates, The Svedberg and Arne Tiselius, was by all counts a half-century-long success story. Chemists at the departments for physical chemistry and biochemistry produced a number of separation techniques that were widely adopted by the scientific community and in various technological applications. Success was also commercial and separation techniques, such as gel filtration, were an important factor behind the meteoric rise of the drug company Pharmacia from the 1950s. (...) The paper focuses on the story behind the invention of gel filtration and the product Sephadex in the 1950s and the emergence of streamlined commercially oriented separation science as a main activity at the department of biochemistry in the 1960s. The dynamics of this development is analyzed from the perspectives of moral economy and storytelling framed by the larger question of the social construction of innovation. The latter point is addressed in a brief discussion about the uses of stories like the one about Sephadex in current research policy. (shrink)

Corporate responsibility (CR) communication has risen dramatically in recent years, following increased demands for transparency. One tendency noted in the literature is that CR communication is organised and structured. Corporations tend to professionalise CR communication in the sense that they provide information that corresponds to demands for transparency that are voiced by certain stakeholders. This also means that experts within the firm tend to communicate with professional stakeholders outside the firm. In this article, a particular aspect of the organisation of (...) CR communication is examined, a phenomenon that we refer to as the ' filtration effect'. By comparing CR communication in parent companies and their subsidiaries, we show empirically that there is considerably less CR communication on the subsidiary level compared to the parent level. We see filtration as a sign of conscious organising of CR communication that implies particular attention to certain stakeholder groups with clearly defined demands and expectations on companies. The strong filtration effect noted in the study suggests that CR communication does not seem to be very much adapted to customers, which may be problematic both from a communicative and ethical perspective. The study covers Sweden's 206 largest retail firms. (shrink)

This paper presents two general results of decidability concerning logics based on an indeterministic metric tense logic, which can be applied to, among others, logics combining knowledge, time and agency. We provide a general Kripke semantics based on a variation of the notion of synchronized Ockhamist frames. Our proof of the decidability is by way of the finite frame property, applying subframe transformations and a variant of the filtration technique.

In this paper an algebraic version for temporal algebras of the logical filtrations for modal and temporal logics is analysed. A structure theorem for free temporal algebras and also some results with regard to the variety of temporal algebras are obtained.

A process of idea filtration in two distinct streams of physics i.e., 1) The dimensionality perspective of spacetime, and 2) The quantum perspective leads us to an understanding of what might be a true reality of all that we perceive. The conclusions arrived at in this paper are a bit perplexing in the sense that our perceived reality could be a manifestation of a combination of 4D + n (n > 0) flat space-time, universal wave function, and cognizance. The (...) work is based on a review and analysis of the main concepts in quantum theory, relativistic physics, and cosmology. Key ideas and conclusions are filtered and logically connected to arrive at what might be a view of the true reality. A significant part of the paper is dedicated to the concept of the “observer” and the “ability of cognizance” that should accompany the “observer”. Though the “observer” is central to modern physics, it is not known what constitutes observation, and the term observer, often open to interpretations, does not have a standard definition and hence, is lacking in clarity. In our analysis, we have argued that the environment, in which the observer-observed system is embedded, emerges as an all-knowing, cognizant, and ideal observer that has the knowledge of the observer-observed system. At a philosophical level, we link to the fundamentals of physics, “consciousness” or “ability of cognizance” as an unavoidable and key element in not only carrying out the observation but perhaps, as believed by many, having a role in shaping the reality perceived. In the review and analysis of another stream of physics, that of General Theory of Relativity (GTR) and cosmology, we examine the question of reality from a cosmological and dimensionality perspective. Research on the 4D and 5D constructs of the universe indicates that the “reality” perceived in 4D spacetime as matter, distance, time, etc., is a manifestation of a higher dimensional 4D + n (n > 0) reality. Theoretical research on this front points towards a 4D-spacetime embedded in a 5D or higher dimensional flat space with matter and energy being a manifestation of the higher dimensions. The flow of logic in this paper leans towards a view of an ultimate true reality that is flat 4D + n (n > 0) space combined with cognizance, universal wave function, and the environment. (shrink)

A modified filtrations argument is used to prove that the relevant logic S of [2] is decidable.

This paper consists of some lecture notes in which conditional logic is treated as an extension of modal logic. Completeness and filtration theorems are provided for some basis systems.

This paper provides a sound and complete proof system for a language that adds to Dynamic Epistemic Logic a discrete previous-time operator as well as single symbol formulas that partially reveal the most recent event that occurred. The completeness theorem is by filtration followed by model unraveling and other model transformations. Decidability follows from the completeness proof. The degree to which it is important to include the additional single symbol formulas is addressed in a discussion about the difficulties of (...) the completeness for a language that only adds the previous-time operator to DEL. Discussion is also given regarding the completeness for a language obtained by removing common knowledge operators from. (shrink)

We show that the relational semantics of the Lambek calculus, both nonassociative and associative, is also sound and complete for its extension with classical propositional logic. Then, using filtrations, we obtain the finite model property for the nonassociative Lambek calculus extended with classical propositional logic.

The East/West divide seems to be as old as history itself, the roots of Orientalism and anti-Semitism lying far beyond the origins of modern Western imperialism. The very project of Western classical republicanism had its darker side: to purloin the legacy of the Greeks, distancing them from Eastern systems deemed 'despotic' and 'other'. Western Republicanism and the Oriental Prince is a thoroughly revisionist book, challenging not only the comfortable view the West has of its own political evolution, but the negative (...) stereotypes of non-Western systems. Not only did these images serve to legitimate early modern European nation states struggling for an identity, but they also served to justify slavery and other forms of domination over subject peoples. Drawing upon archaeological and epigraphic evidence, Springborg discusses the Mesopotamian and ancient Egyptian contribution of political forms and cultic institutions to classical Graeco-Roman civilization, an Eastern legacy to the West long obscured for political reasons. A different reading of the foundation myths of Athens and Rome, certain texts of Plato, Aristotle, and the writings of Herodotus, Isocrates, Plutarch and Diodorus Siculus, permits us to restore possible lines of filtration. Renaissance thought, long believed to have ushered in the Western classical republican tradition, demonstrates a curious ambivalence towards powerful Eastern system, objects of fascination as much as fear. We do not yet find sedimented the divide between Western Democracy and oriental despotism, in which post-Reformation thought as been set in stone. This major new study will be of interest to students of political history, political theory, comparative politics and political archaeology. (shrink)

This paper proves decidability of a range of weak relevant logics using decision procedures based on the Routley-Meyer semantics. Logics are categorized as F-logics, for those proved decidable using a filtration method, and U-logics, for those proved decidable using a direct (unfiltered) method. Both of these methods are set out as reductio methods, in the style of Hughes and Cresswell. We also examine some extensions of the U-logics where the method fails and infinite sequences of worlds can be generated.

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

Past public announcement operators have been defined in Hoshi and Yap :259–281, 2009) and Yap, to describe an agent’s knowledge before an announcement occurs. These operators rely on branching-time structures that do not mirror the traditional, relativization-based semantics of public announcement logic, and favor a historical reading of past announcements. In this paper, we introduce reverse public announcement operators that are interpreted on expanded models. Our model expansion adds accessibility links from an epistemic model \ to a filtrated submodel of (...) the canonical model for \. Here \ is the minimal normal modal logic together with \ axioms for the universal operator U. This yields a highly general pre-announcement version of \ that makes our operators potentially useful for studying non-standard interpretations of rescinded announcements in PAL. Indeed, we find that our reverse announcement operators cannot be represented by product update, and that they have an intimate connection with the knowledge forgetting of Zhang and Zhou :1525–1537, 2009). We show that the logic resulting from adding reverse announcements to PAL is sound and complete. (shrink)

A common approach to quantum physics is enshrouded in a jargon which treats state vectors as attributes of physical systems and the concept of state preparation as a filtration scheme wherein a process involving measurement selects from a primordial assembly of systems those bearing some prescribed vector of interest. By contrast, the empirical experiences with which quantum theory is actually concerned relate measurement and preparation in quite an opposite manner. Reproducible preparation schemes are logically and temporally anterior to measurement (...) acts. Measurement extracts numbers from systems prepared in a specified manner; these data are then regularized by the theory by means of a state concept which is in turn used to characterize succinctly the given mode of preparation. The present paper offers, in a simple spin model, a method for determining the quantum state that represents any reproducible preparation. (shrink)

This paper extends David Lewis' result that all first degree modal logics are complete to weakly aggregative modal logic by providing a filtration-theoretic version of the canonical model construction of Apostoli and Brown. The completeness and decidability of all first-degree weakly aggregative modal logics is obtained, with Lewis's result for Kripkean logics recovered in the case k = 1.

Analyses of environmental DNAs have provided tantalizing evidence for “rozellida” or “cryptomycota”, a clade of mostly undescribed and deeply diverging aquatic fungi. Here, we put cryptomycota into perspective through consideration of Rozella, the only clade member growing in culture. This is timely on account of the publication in Nature of the first images of uncultured cryptomycota from environmental filtrates, where molecular probes revealed non‐motile cyst‐like structures and motile spores, all lacking typical fungal chitinous cell walls. Current studies of Rozella can (...) complement these fragmentary observations from environmental samples. Rozella has a fungal‐specific chitin synthase and its resting sporangia have walls that appear to contain chitin. Cryptomycota, including Rozella, lack a cell wall when absorbing food but like some other fungi, they may have lost their “dinner jacket” through convergence. Rather than evolutionary intermediates, the cryptomycota may be strange, divergent fungi that evolved from an ancestor with a nearly complete suite of classical fungal‐specific characters. (shrink)

Proofs and countermodels are the two sides of completeness proofs, but, in general, failure to find one does not automatically give the other. The limitation is encountered also for decidable non-classical logics in traditional completeness proofs based on Henkin’s method of maximal consistent sets of formulas. A method is presented that makes it possible to establish completeness in a direct way: For any given sequent either a proof in the given logical system or a countermodel in the corresponding frame class (...) is found. The method is a synthesis of a generation of calculi with internalized relational semantics, a Tait–Schütte–Takeuti style completeness proof, and procedures to finitize the countermodel construction. Finitizations for intuitionistic propositional logic are obtained through the search for a minimal derivation, through pruning of infinite branches in search trees by means of a suitable syntactic counterpart of semantic filtration, or through a proof-theoretic embedding into an appropriate provability logic. A number of examples illustrates the method, its subtleties, challenges, and present scope. (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)

This paper connects the following four topics: a class of generalized graphs whose relations do not have fixed arities called hypergraphs, a family of non-normal modal logics rejecting the aggregative axiom, an epistemic framework fighting logical omniscience, and the classical group knowledge modality of ‘someone knows’. Through neighborhood frames as their meeting point, we show that, among many completeness results obtained in this paper, the limit of a family of weakly aggregative logics is both exactly the modal logic of hypergraphs (...) and also the epistemic logic of local reasoning with veracity and positive introspection, and upon adding a single combinatorial axiom, it is also the logic of ‘someone knows’ for a fixed finite number of positively introspective agents. At the core of all these completeness results is a new canonical neighborhood model construction for monotone modal logics that is capable of dealing with all these diverse cases. We also provide an axiomatization for the logic of all non-n-colorable hypergraphs based on a filtration argument that also shows the decidability of the logics of hypergraphs we study. (shrink)

We investigate an enrichment of the propositional modal language L with a "universal" modality ■ having semantics x ⊧ ■φ iff ∀y(y ⊧ φ), and a countable set of "names" - a special kind of propositional variables ranging over singleton sets of worlds. The obtained language ℒ $_{c}$ proves to have a great expressive power. It is equivalent with respect to modal definability to another enrichment ℒ(⍯) of ℒ, where ⍯ is an additional modality with the semantics x ⊧ ⍯φ (...) iff Vy(y ≠ x → y ⊧ φ). Model-theoretic characterizations of modal definability in these languages are obtained. Further we consider deductive systems in ℒ $_{c}$ . Strong completeness of the normal ℒ $_{c}$ logics is proved with respect to models in which all worlds are named. Every ℒ $_{c}$ -logic axiomatized by formulae containing only names (but not propositional variables) is proved to be strongly frame-complete. Problems concerning transfer of properties ([in]completeness, filtration, finite model property etc.) from ℒ to ℒ $_{c}$ are discussed. Finally, further perspectives for names in multimodal environment are briefly sketched. (shrink)

The paper studies many-dimensional modal logics corresponding to products of Kripke frames. It proves results on axiomatisability, the finite model property and decidability for product logics, by applying a rather elaborated modal logic technique: p-morphisms, the finite depth method, normal forms, filtrations. Applications to first order predicate logics are considered too. The introduction and the conclusion contain a discussion of many related results and open problems in the area.

This paper presents proofs of completeness and decidability of a non-temporal fragment of an Xstit logic. This shows a distinction between the non-temporal fragments of Xstit logic and regular stit logic since the latter is undecidable. The proof of decidability is via the finite model property. The finite model property is shown to hold by constructing a filtration. However, the set that is used to filter the models isn’t simply closed under subformulas, it has more complex closure conditions. The (...) filtration set is akin to the Fischer–Ladner closure of a set used to show completeness and decidability of propositional dynamic logic. (shrink)

Disjoint n-amalgamation is a condition on a complete first-order theory specifying that certain locally consistent families of types are also globally consistent. In this article, we show that if a countably categorical theory T admits an expansion with disjoint n-amalgamation for all n, then T is pseudofinite. All theories which admit an expansion with disjoint n-amalgamation for all n are simple, but the method can be extended, using filtrations of Fraïssé classes, to show that certain nonsimple theories are pseudofinite. As (...) case studies, we examine two generic theories of equivalence relations, Tfeq∗ and TCPZ, and show that both are pseudofinite. The theories Tfeq∗ and TCPZ are not simple, but they have NSOP1. This is established here for TCPZ for the first time. (shrink)

This paper connects the following three apparently unrelated topics: an epistemic framework fighting logical omniscience, a class of generalized graphs without the arities of relations, and a family of non-normal modal logics rejecting the aggregative axiom. Through neighborhood frames as their meeting point, we show that, among many completeness results obtained in this paper, the limit of a family of weakly aggregative logics is both exactly the modal logic of hypergraphs and also the epistemic logic of local reasoning with veracity (...) and positive introspection. The logics studied are shown to be decidable based on a filtration construction. (shrink)

A proof is given that the set of maximal intermediate propositional logics with the disjunction property and the set of maximal intermediate predicate logics with the disjunction property and the explicit definability property have the power of continuum. To prove our results, we introduce various notions which might be interesting by themselves. In particular, we illustrate a method to generate wide sets of pairwise "constructively incompatible constructive logics". We use a notion of "semiconstructive" logic and define wide sets of "constructive" (...) logics by representing the "constructive" logics as "limits" of decreasing sequences of "semiconstructive" logics. Also, we introduce some generalizations of the usual filtration techniques for propositional logics. For instance, "filtrations over rank formulas" are used to show that any two different logics belonging to a suitable uncountable set of "constructive" logics are "constructively incompatible". (shrink)

We extend the concept that life is an informational phenomenon, at every level of organisation, from molecules to the global ecological system. According to this thesis: living is information processing, in which memory is maintained by both molecular states and ecological states as well as the more obvious nucleic acid coding; this information processing has one overall function—to perpetuate itself; and the processing method is filtration of, and synthesis of, information at lower levels to appear at higher levels in (...) complex systems . We show how information patterns, are united by the creation of mutual context, generating persistent consequences, to result in ‘functional information’. This constructive process forms arbitrarily large complexes of information, the combined effects of which include the functions of life. Molecules and simple organisms have already been measured in terms of functional information content; we show how quantification may be extended to each level of organisation up to the ecological. In terms of a computer analogy, life is both the data and the program and its biochemical structure is the way the information is embodied. This idea supports the seamless integration of life at all scales with the physical universe. The innovation reported here is essentially to integrate these ideas, basing information on the ‘general definition’ of information, rather than simply the statistics of information, thereby explaining how functional information operates throughout life. (shrink)

ABSTRACT We investigate a logic PFD, as introduced in [FA]. In our notation, this logic is enriched with operators P> r(r € [0,1]) where the intended meaning of P> r φ is “the probability of φ (at a given world) is strictly greater than r”. We also adopt the semantics of [FA]: a class of “F-restricted probabilistic kripkean models”. We give a completeness proof that essentially differs from that in [FA]: our “peremptory lemma” (a lemma in PFD rather than about (...) it) facilitates the construction of a canonical model for PFD considerably. We show that this construction can be carried out using only finitary means, and also give a filtration-technique for the intended models. We then define an alternative (in some sense more natural) semantics for the logic, and show some of its properties. Finally, we prove decidability of the logic. (shrink)

The variety of Heyting algebras has two well-behaved locally finite reducts, the variety of bounded distributive lattices and the variety of implicative semilattices. The variety of bounded distributive lattices is generated by the →-free reducts of Heyting algebras, while the variety of implicative semilattices is generated by the ∨-free reducts. Each of these reducts gives rise to canonical formulas that generalize Jankov formulas and provide an axiomatization of all superintuitionistic logics. The ∨-free reducts of Heyting algebras give rise to the (...) -canonical formulas that we studied in an earlier work. Here we introduce the -canonical formulas, which are obtained from the study of the →-free reducts of Heyting algebras. We prove that every si-logic is axiomatizable by -canonical formulas. We also discuss the similarities and differences between these two kinds of canonical formulas. One of the main ingredients of these formulas is a designated subset D of pairs of elements of a finite subdirectly irreducible Heyting algebra A. When D=A2, we show that the -canonical formula of A is equivalent to the Jankov formula of A. On the other hand, when D=∅, the -canonical formulas produce a new class of si-logics we term stable si-logics. We prove that there are continuum many stable si-logics and that all stable si-logics have the finite model property. We also compare stable si-logics to splitting and subframe si-logics. (shrink)

For the past two decades, agricultural workers in regions of Central America have reported an epidemic of chronic kidney disease of undetermined etiology (CKDu) that is not associated with established risk factors of chronic kidney disease. Several hypotheses have emerged, but the etiology of CKDu remains elusive and controversial. The aim of this literature review was to describe the potential risk factors of CKDu in Mesoamerica and implications for the U.S. agricultural worker population. PubMed and CINAHL databases were searched for (...) articles published between 2000 and 2018 that examined CKDu in Mesoamerica; 29 original studies were included in this review. CKDu is a multifactorial disease that is often asymptomatic with hallmark characteristics of elevated serum creatinine and blood urea nitrogen (BUN), low glomerular filtration rate, electrolyte abnormalities, and non-nephrotic proteinuria. Reducing the global prevalence of CKDu will require more robust studies on causal mechanisms and on interventions that can reduce morbidity and mortality in vulnerable populations. (shrink)

In this paper a unified framework for dealing with a broad family of propositional multimodal logics is developed. The key tools for presentation of the logics are the notions of closure relation operation and monotonous relation operation. The two classes of logics: FiRe-logics (finitely reducible logics) and LaFiRe-logics (FiRe-logics with local agreement of accessibility relations) are introduced within the proposed framework. Further classes of logics can be handled indirectly by means of suitable translations. It is shown that the logics from (...) these classes have the finite model property with respect to the class of -formulae, i.e. each -formula has a -model iff it has a finite -model. Roughly speaking, a -formula is logically equivalent to a formula in negative normal form without occurrences of modal operators with necessity force. In the proof we introduce a substantial modification of Claudio Cerrato's filtration technique that has been originally designed for graded modal logics. The main core of the proof consists in building adequate restrictions of models while preserving the semantics of the operators used to build terms indexing the modal operators. (shrink)

In this paper a unified framework for dealing with a broad family of propositional multimodal logics is developed. The key tools for presentation of the logics are the notions of closure relation operation and monotonous relation operation. The two classes of logics: FiRe-logics (finitely reducible logics) and LaFiRe-logics (FiRe-logics with local agreement of accessibility relations) are introduced within the proposed framework. Further classes of logics can be handled indirectly by means of suitable translations. It is shown that the logics from (...) these classes have the finite model property with respect to the class of ♦-formulae, i.e. each ♦-formula has a ℒ-model iff it has a finite ℒ-model. Roughly speaking, a ♦-formula is logically equivalent to a formula in negative normal form without occurrences of modal operators with necessity force. In the proof we introduce a substantial modification of Claudio Cerrato's filtration technique that has been originally designed for graded modal logics. The main core of the proof consists in building adequate restrictions of models while preserving the semantics of the operators used to build terms indexing the modal operators. (shrink)