Narrow Band-pass filtering techniques have been a challenging task since the inception of audio and telecommunication applications. The challenge involves keeping quality factor, gain and mid-frequency of the filter independent of each other. The critical applications require a design that ensures mid-frequency immune to the circuit component tolerances. It becomes increasingly difficult for low-frequency applications where the shift in few Hz in mid-frequency would cause desired frequencies to fall outside the filter’s bandwidth and go undetected. The selection of (...) right topology of the filter for the best performance is the key to successful design. This book objectively compares the relative performance of none popular narrow band-pass filter topologies. The filter topologies are evaluated using a real-world practical example of designing an extremely narrow band-pass filter. The book provides guidelines for selecting the right topology for the low-frequency narrow band-pass filter. (shrink)

We find some characterizations of the Axiom of Choice in terms of certain families of open sets in T1 spaces.

In this paper we develop a point-free approach to the study of topological spaces and functions on them, establish platforms for both and present some findings on recursive points. In the first sections of the paper, we obtain conditions under which our approach leads to the generation of ideal objects with which mathematicians work. Next, we apply the effective version of our approach to the real numbers, and make exact connections to the classical approach to recursive reals. In the succeeding (...) sections of the paper, we introduce machinery to produce functions on topological spaces and find succinct conditions which will be effectivized in our sequel. (shrink)

In this paper we introduce the notion of filter on the neutrosophic crisp set, then we consider a generalization of the filter’s studies. Afterwards, we present the important neutrosophic crisp filters. We also study several relations between different neutrosophic crisp filters and neutrosophic topologies. Possible applications to database systems are touched upon.

In this paper we introduce the notion of filter on the neutrosophic crisp set, then we consider a generalization of the filter’s studies. Afterwards, we present the important neutrosophic crisp filters. We also study several relations between different neutrosophic crisp filters and neutrosophic topologies. Possible applications to database systems are touched upon.

We study the Medvedev degrees of mass problems with distinguished topological properties, such as denseness, closedness, or discreteness. We investigate the sublattices generated by these degrees; the prime ideal generated by the dense degrees and its complement, a prime filter; the filter generated by the nonzero closed degrees and the filter generated by the nonzero discrete degrees. We give a complete picture of the relationships of inclusion holding between these sublattices, these filters, and this ideal. We show (...) that the sublattice of the closed Medvedev degrees is not a Brouwer algebra. We investigate the dense degrees of mass problems that are closed under Turing equivalence, and we prove that the dense degrees form an automorphism base for the Medvedev lattice. The results hold for both the Medvedev lattice on the Baire space and the Medvedev lattice on the Cantor space. (shrink)

In this paper, we consider a collection of filters of a BL-algebra A. We use the concept of congruence relation with respect to filters to construct a uniformity which induces a topology on A. We study the properties of this topology regarding different filters.

We give topological proofs of Görnemann’s adaptation to Heyting algebras of the Rasiowa-Sikorski Lemma for Boolean algebras; and of the Rauszer-Sabalski generalisation of it to distributive lattices. The arguments use the Priestley topology on the set of prime filters, and the Baire category theorem. This is preceded by a discussion of criteria for compactness of various spaces of subsets of a lattice, including spaces of filters, prime filters etc.

The purpose of this paper is to compare the notion of a Grzegorczyk point introduced in [19] (and thoroughly investigated in [3, 14, 16, 18]) to the standard notions of a filter in Boolean algebras and round filter in Boolean contact algebras. In particular, we compare Grzegorczyk points to filters and ultrafilters of atomic and atomless algebras. We also prove how a certain extra axiom influences topological spaces for Grzegorczyk contact algebras. Last but not least, we do not (...) refrain from a philosophical interpretation of the results from the paper. (shrink)

In this paper, we consider a collection of filters of a BL-algebra A. We use the concept of congruence relation with respect to filters to construct a uniformity which induces a topology on A. We study the properties of this topology regarding different filters. (© 2007 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim).

Weak filters were introduced by K. Schlechta in the ’90s with the aim of interpreting defaults via a generalized ‘most’ quantifier in first-order logic. They arguably represent the largest class of structures that qualify as a ‘collection of large subsets’ of a given index set |$I$|⁠, in the sense that it is difficult to think of a weaker, but still plausible, definition of the concept. The notion of weak ultrafilter naturally emerges and has been used in epistemic logic and other (...) knowledge representation (KR) applications. We provide a comprehensive exposition of weak filters and ultrafilters, comparing them with their classical counterparts that have found very important applications in logic, set theory and topology. Weak (ultra)filters capture the ‘majorities’ of social choice theory (which coincide with the commonsense understanding of a ‘large subset’) and in that respect, they outperform classical (ultra)filters in their role as ‘collections of large subsets’. Yet, they lack some of the elegant properties of classical (ultra)filters that make them an almost perfect match for logical theories. We investigate the extent to which some important classical results carry through in this new setting, and we focus on genuinely weak filters and genuinely weak ultrafilters. For weak ultrafilters, we proceed to provide concrete examples, answer questions of existence and characterize their construction. The class of weak (ultra)filters represents a genuine contribution of KR to set theory that might be of some interest to set theorists too and we initiate this study by providing a glimpse on natural set-theoretic questions. (shrink)

We give topological characterizations of filters${\cal F}$onωsuch that the Mathias forcing${M_{\cal F}}$adds no dominating reals or preserves ground model unbounded families. This allows us to answer some questions of Brendle, Guzmán, Hrušák, Martínez, Minami, and Tsaban.

For a free filter F on $$\omega $$ ω, endow the space $$N_F=\omega \cup \{p_F\}$$ N F = ω ∪ { p F }, where $$p_F\not \in \omega $$ p F ∉ ω, with the topology in which every element of $$\omega $$ ω is isolated whereas all open neighborhoods of $$p_F$$ p F are of the form $$A\cup \{p_F\}$$ A ∪ { p F } for $$A\in F$$ A ∈ F. Spaces of the form $$N_F$$ N F constitute (...) the class of the simplest non-discrete Tychonoff spaces. The aim of this paper is to study them in the context of the celebrated Josefson–Nissenzweig theorem from Banach space theory. We prove, e.g., that, for a filter F, the space $$N_F$$ N F carries a sequence $$\langle \mu _n:n\in \omega \rangle $$ ⟨ μ n : n ∈ ω ⟩ of normalized finitely supported signed measures such that $$\mu _n(f)\rightarrow 0$$ μ n ( f ) → 0 for every bounded continuous real-valued function f on $$N_F$$ N F if and only if $$F^*\le _K{\mathcal {Z}}$$ F ∗ ≤ K Z, that is, the dual ideal $$F^*$$ F ∗ is Katětov below the asymptotic density ideal $${\mathcal {Z}}$$ Z. Consequently, we get that if $$F^*\le _K{\mathcal {Z}}$$ F ∗ ≤ K Z, then: (1) if X is a Tychonoff space and $$N_F$$ N F is homeomorphic to a subspace of X, then the space $$C_p^*(X)$$ C p ∗ ( X ) of bounded continuous real-valued functions on X contains a complemented copy of the space $$c_0$$ c 0 endowed with the pointwise topology, (2) if K is a compact Hausdorff space and $$N_F$$ N F is homeomorphic to a subspace of K, then the Banach space C(K) of continuous real-valued functions on K is not a Grothendieck space. The latter result generalizes the well-known fact stating that if a compact Hausdorff space K contains a non-trivial convergent sequence, then the space C(K) is not Grothendieck. (shrink)

In this paper we show that some standard topological constructions may be fruitfully used in the theory of closure spaces (see [5], [4]). These possibilities are exemplified by the classical theorem on the universality of the Alexandroff's cube for T 0-closure spaces. It turns out that the closure space of all filters in the lattice of all subsets forms a generalized Alexandroff's cube that is universal for T 0-closure spaces. By this theorem we obtain the following characterization of the consequence (...) operator of the classical logic: If is a countable set and C: P() P() is a closure operator on X, then C satisfies the compactness theorem iff the closure space ,C is homeomorphically embeddable in the closure space of the consequence operator of the classical logic.We also prove that for every closure space X with a countable base such that the cardinality of X is not greater than 2 there exists a subset X of irrationals and a subset X of the Cantor's set such that X is both a continuous image of X and a continuous image of X. (shrink)

It is shown that in ZF set theory the axiom of choice holds iff every non empty topological space has a maximal closed filter.

Nonlinear time series denoising is the prerequisite for extracting effective information from observation sequence. An effective chaotic signal denoising method not only has a good signal-to-noise ratio enhancement performance, but also can remain as a good unpredictable denoised signal. However, the inherent characteristics of chaos, such as extreme sensitivity to initial values and broadband spectrum, pose challenges for noise reduction of polluted chaotic signals. To address these issues, an adaptive smoothing multiscale morphological filtering is proposed to reconstruct chaotic signals. In (...) the process of noise reduction for contaminated chaotic signals, firstly, a multiscale morphological filter is constructed adaptively according to the multiscale permutation entropy of morphological filter residuals, and the contaminated signals are filtered. Secondly, the weight coefficients of scale structural element are calculated by the residual sum of squares operation, and the chaotic signals are reconstructed. Finally, the resampled filter signals are smoothed by cubic B-spline interpolation operation. In the experiment, the Lorenz signal with white Gaussian noise, the measured sunspot, and the chaotic vibration signal are reconstructed by four comparison methods. The test results show that the proposed ASMMF method has obvious advantages in noise suppression and topological trajectory restoration. (shrink)

We answer a question of Just, Miller, Scheepers and Szeptycki whether certain diagonalization properties for sequences of open covers are provably closed under taking finite or countable unions.

We give an idea of uniform approach to the problem of characterization of absolute extensors for categories of topological spaces [21], closure spaces [15], Boolean algebras [22], and distributive lattices [4]. In this characterization we use the notion of retract of the closure space of filters in the lattice of all subsets.

In the second installment to Gruszczyński and Pietruszczak we carry out an analysis of spaces of points of Grzegorczyk structures. At the outset we introduce notions of a concentric and \-concentric topological space and we recollect some facts proven in the first part which are important for the sequel. Theorem 2.9 is a strengthening of Theorem 5.13, as we obtain stronger conclusion weakening Tychonoff separation axiom to mere regularity. This leads to a stronger version of Theorem 6.10. Further, we show (...) that Grzegorczyk points are maximal contracting filters in the sense of De Vries, but the converse inclusion is not necessarily true. We also compare the notions of a Grzegorczyk point and an ultrafilter, and establish several properties of topological spaces based on Grzegorczyk structures. The main results of the paper are representation and completion theorems for G-structures. We prove both set-theoretical and topological representation theorems for various classes of G-structures. We also present topological object duality theorem for the class of complete G-structures and the class of concentric spaces, both restricted to structures which satisfy countable chain condition. We conclude the paper with proving equivalence of the original Grzegorczyk axiom with the one accepted by us as axiom. (shrink)

This paper continues our study of computable point-free topological spaces and the metamathematical points in them. For us, a point is the intersection of a sequence of basic open sets with compact and nested closures. We call such a sequence a sharp filter. A function fF from points to points is generated by a function F from basic open sets to basic open sets such that sharp filters map to sharp filters. We restrict our study to functions that have (...) at least all computable points in their domains.We follow Turing's approach in stating that a point is computable if it is the limit of a computable sharp filter; we then define the Turing degree Deg of a general point x in an analogous way. Because of the vagaries of the definition, a result of J. Miller applies and we note that not all points in all our spaces have Turing degrees; but we also show a certain class of points do. We further show that in ℝn all points have Turing degrees and that these degrees are the same as the classical Turing degrees of points defined by other researchers.We also prove the following: For a point x that has a Turing degree and lies either on a computable tree T or in the domain of a computable function fF, there is a sharp filter on T or in dom converging to x and with the same Turing degree as x. Furthermore, all possible Turing degrees occur among the degrees of such points for a given computable function fF or a complete, computable, binary tree T. For each x ∈ dom for which x and fF have Turing degrees, Deg) ≤ Deg. Finally, the Turing degrees of the sharp filters convergent to a given x are closed upward in the partial order of all Turing degrees. (shrink)

Membership in a protein domain database does not a domain make; a feature we realized when generating a consensus view of protein fold space with our consensus domain dictionary (CDD). This dictionary was used to select representative structures for characterization of the protein dynameome: the Dynameomics initiative. Through this endeavor we rejected a surprising 40% of the 1,695 folds in the CDD as being non‐autonomous folding units. Although some of this was due to the challenges of grouping similar fold (...) class='Hi'>topologies, the dissonance between the cataloguing and structural qualification of protein domains remains surprising. Another potential factor is previously overlooked intrinsic disorder; predictions suggest that 40% of proteins have either local or global disorder. One thing is clear, filtering a structural database and ensuring a consistent definition for protein domains is crucial, and caution is prescribed when generalizations of globular domains are drawn from unfiltered protein domain datasets. (shrink)

Membership in a protein domain database does not a domain make; a feature we realized when generating a consensus view of protein fold space with our consensus domain dictionary (CDD). This dictionary was used to select representative structures for characterization of the protein dynameome: the Dynameomics initiative. Through this endeavor we rejected a surprising 40% of the 1,695 folds in the CDD as being non‐autonomous folding units. Although some of this was due to the challenges of grouping similar fold (...) class='Hi'>topologies, the dissonance between the cataloguing and structural qualification of protein domains remains surprising. Another potential factor is previously overlooked intrinsic disorder; predictions suggest that 40% of proteins have either local or global disorder. One thing is clear, filtering a structural database and ensuring a consistent definition for protein domains is crucial, and caution is prescribed when generalizations of globular domains are drawn from unfiltered protein domain datasets. (shrink)

In this paper we continue our work of Kalantari and Welch . There we introduced machinery to produce a point-free approach to points and functions on topological spaces and found conditions for both which lend themselves to effectivization. While we studied recursive points in that paper, here, we present two useful classes of recursive functions on topological spaces, apply them to the reals, and find precise accounting for the nature of the properties of some examples that exist in the literature. (...) We end with a construction of a recursive function on a small subset of the unit interval which is strongly nonextendible. (shrink)

This paper is a sequel to our [7]. In that paper we constructed a Π1 0 tree of avoidable points. Here we construct a Π1 0 tree of shadow points. This tree is a tree of sharp filters, where a sharp filter is a nested sequence of basic open sets converging to a point. In the construction we assign to each basic open set on the tree an address in 2<ω. One interesting fact is that while our Π1 0 (...) tree of sharp filters (a subtree of Δ<ω) is isomorphic to the tree of addresses (a subtree of 2<ω), the tree of addresses is recursively enumerable but not recursive. To achieve this end we use a finite injury priority argument. (shrink)

his is a book to broaden the mind. It brings the reader into a world only vaguely imaginable and richly enlightens it with extraordinary attention to interesting historical details. It is beautifully written and endlessly interesting.

Mereotopology is that branch of the theory of regions concerned with topological properties such as connectedness. It is usually developed by considering the parthood relation that characterizes the, perhaps non-classical, mereology of Space (or Spacetime, or a substance filling Space or Spacetime) and then considering an extra primitive relation. My preferred choice of mereotopological primitive is interior parthood . This choice will have the advantage that filters may be defined with respect to it, constructing “points”, as Peter Roeper has done (...) (“Region-based topology”, Journal of Philosophical Logic , 26 (1997), 25–309). This paper generalizes Roeper’s result, relying only on mereotopological axioms, not requiring an underlying classical mereology, and not assuming the Axiom of Choice. I call the resulting mathematical system an approximate lattice , because although meets and joins are not assumed they are approximated. Theorems are proven establishing the existence and uniqueness of representations of approximate lattices, in which their members, the regions, are represented by sets of “points” in a topological “space”. (shrink)

In this book the authors introduce and study the following notions: Neutrosophic Crisp Points, Neutrosophic Crisp Relations, Neutrosophic Crisp Sets, Neutrosophic Set Generated by (Characteristic Function), alpha-cut Level for Neutrosophic Sets, Neutrosophic Crisp Continuous Function, Neutrosophic Crisp Compact Spaces, Neutrosophic Crisp Nearly Open Sets, Neutrosophic Crisp Ideals, Neutrosophic Crisp Filter, Neutrosophic Crisp Local Functions, Neutrosophic Crisp Sets via Neutrosophic Crisp Ideals, Neutrosophic Crisp L-Openness and Neutrosophic Crisp L-Continuity, Neutrosophic Topological Region, Neutrosophic Closed Set and Neutrosophic Continuous Function, etc. They (...) compute the distances between neutrosophic sets and extend it to Neutrosophic Hesitancy Degree. The authors also generalize the Crisp Topological Space and Intuitionistic Topological Space to the notion of Neutrosophic Crisp Topological Space. At the end, they present applications to Neutrosophic Database, and show a security scheme based on Public Key Infrastructure (PKI) using Neutrosophic Logic Manipulation. The authors utilize neutrosophic sets in order to analyze social networks data conducted through learning activities, and for the Geographical Information Systems (GIS) they employ fundamental concepts and properties of a Neutrosophic Spatial Region. Keywords: Neutrosophic Crisp Points; Neutrosophic Crisp Relations; Neutrosophic Crisp Sets; Neutrosophic Crisp Continuous Function; Neutrosophic Crisp Compact Spaces; Neutrosophic Crisp Nearly Open Sets; Neutrosophic Crisp Ideals; Neutrosophic Crisp Filter; Neutrosophic Crisp Local Functions; Neutrosophic Crisp Sets via Neutrosophic Crisp Ideals; Neutrosophic Crisp L-Openness and Neutrosophic Crisp L-Continuity; Neutrosophic Topological Region; Neutrosophic Closed Set and Neutrosophic Continuous Function; Neutrosophic Hesitancy Degree; Neutrosophic Crisp Topological Space; Neutrosophic Database; Neutrosophic Logic Manipulation; Neutrosophic Spatial Region. (shrink)

We initiate the reverse mathematics of general topology. We show that a certain metrization theorem is equivalent to Π12 comprehension. An MF space is defined to be a topological space of the form MF with the topology generated by {Np ∣ p ϵ P}. Here P is a poset, MF is the set of maximal filters on P, and Np = {F ϵ MF ∣ p ϵ F }. If the poset P is countable, the space MF is said to (...) be countably based. The class of countably based MF spaces can be defined and discussed within the subsystem ACA0 of second order arithmetic. One can prove within ACA0 that every complete separable metric space is homeomorphic to a countably based MF space which is regular. We show that the converse statement, “every countably based MF space which is regular is homeomorphic to a complete separable metric space,” is equivalent to. The equivalence is proved in the weaker system. This is the first example of a theorem of core mathematics which is provable in second order arithmetic and implies Π12 comprehension. (shrink)

We initiate the reverse mathematics of general topology. We show that a certain metrization theorem is equivalent to Π2 1 comprehension. An MF space is defined to be a topological space of the form MF(P) with the topology generated by $\lbrace N_p \mid p \in P \rbrace$ . Here P is a poset, MF(P) is the set of maximal filters on P, and $N_p = \lbrace F \in MF(P) \mid p \in F \rbrace$ . If the poset P is countable, (...) the space MF(P) is said to be countably based. The class of countably based MF spaces can be defined and discussed within the subsystem ACA0 of second order arithmetic. One can prove within ACA0 that every complete separable metric space is homeomorphic to a countably based MF space which is regular. We show that the converse statement, "every countably based MF space which is regular is homeomorphic to a complete separable metric space," is equivalent to Π2 1-CA0. The equivalence is proved in the weaker system Π1 1-CA0. This is the first example of a theorem of core mathematics which is provable in second order arithmetic and implies Π2 1 comprehension. (shrink)

The object of this paper is to make a study of four systems of modal logic (S4, S5, and their intuitionistic analogues IM4 and IM5) with the techniques of the theory of abstract logics set up by Suszko, Bloom, Brown, Verdú and others. The abstract concepts corresponding to such systems are defined as generalizations of the logics naturally associated to their algebraic models (topological Boolean or Heyting algebras, general or semisimple). By considering new suitably defined connectives and by distinguishing between (...) having the rule of necessitation only for theorems or as a full inference rule (which amounts to dealing with all filters or with open filters of the algebras) we are able to reduce the study of a modal (abstract) logic L to that of two nonmodal logics L - and L + associated with L. We find that L is "of IM4 type" if and only if L - and L + are both intuitionistic and have the same theorems, and logics of type S4, IM5 or S5 are obtained from those of type IM4 simply by making classical L -, L + or both. We compare this situation with that found in recent approaches to intuitionistic modal logic using birelational models or using higher-level sequent-systems. The treatment of modal systems with abstract logics is rather new, and in our way to it we find several general constructions and results which can also be applied to other modal systems weaker than those we study in detail. (shrink)

Given their commitment to practices, science studies have bestowed considerable attention upon objects. We have the boundary object, the standardized package, the network object, the immutable mobile, the fluid object, even a fire object has entered the scene. However, these objects do not provide us with a way of understanding their historicity. They are timeless, motionless pictures rather than things that change over time, and while enacting ‘historical moments’ they do not make visible the histories they contain within them. What (...) kind of object could embody history and make that history visible? Inspired by Michel Serres, I suggest the folded object is a way to attend to the temporality and spatiality of objects. In this article I explore this new object by unravelling the history of a DNA reference sequence. I show how, ever since it was produced in the early 1980s, attempts have been made to filter race out of the sequence. That effort has failed due to what one could call ‘political noise’. Making and remaking the sequence have left traces that cannot be erased. (shrink)

A new foundation for constructive nonstandard analysis is presented. It is based on an extension of a sheaf-theoretic model of nonstandard arithmetic due to I. Moerdijk. The model consists of representable sheaves over a site of filter bases. Nonstandard characterisations of various notions from analysis are obtained: modes of convergence, uniform continuity and differentiability, and some topological notions. We also obtain some additional results about the model. As in the classical case, the order type of the nonstandard natural numbers (...) is a dense set of copies of the integers. Every standard set has a hyperfinite enumeration of its standard elements in the model. All arguments are carried out within a constructive and predicative metatheory: Martin-Löf's type theory. (shrink)

Reviewed Works:Tomek Bartoszynski, Marion Scheepers, Set Theory, Annual Boise Extravaganza in Set Theory Conference, March 13-15, 1992, April 10-11, 1993, March 25-27, 1994, Boise State University, Boise, Idaho.R. Aharoni, A. Hajnal, E. C. Milner, Interval Covers of a Linearly Ordered Set.Eyal Amir, Haim Judah, Souslin Absoluteness, Uniformization and Regularity Properties of Projective Sets.Tomek Bartoszynski, Ireneusz Reclaw, Not Every $\gamma$-Set is Strongly Meager.Andreas Blass, Reductions Between Cardinal Characteristics of the Continuum.Claude Laflamme, Filter Games and Combinatorial Properties of Strategies.R. Daniel Mauldin, (...) Analytic non-Borel Sets Modulo Null Sets.Janusz Pawlikowski, Laver's Forcing and Outer Measure.Marion Scheepers, Meager Sets and Infinite Games.Saharon Shelah, On Some Problems in General Topology.Saharon Shelah, Remarks on $\aleph_1$-CWH not CWH First Countable Spaces.Juris Steprans, Cardinal Invariants Associated with Hausdorff Capacities. (shrink)

Płonka sums consist of an algebraic construction similar, in some sense, to direct limits, which allows to represent classes of algebras defined by means of regular identities. Recently, Płonka sums have been connected to logic, as they provide algebraic semantics to logics obtained by imposing a syntactic filter to given logics. In this paper, I present a very general topological duality for classes of algebras admitting a Płonka sum representation in terms of dualisable algebras.

The starting point for the investigation in this paper is the following McKinsey-Tarski's Theorem: if f and g are algebraic functions (of the same number of variables) in a topological Boolean algebra (TBA) and if C(f)C(g) vanishes identically, then either f or g vanishes identically. The present paper generalizes this theorem to B-algebras and shows that validity of that theorem in a variety of B-algebras (B-variety) generated by SCI B -equations implies that its free Lindenbaum-Tarski's algebra is normal. This is (...) important in the semantical analysis of SCI B (the Boolean strengthening of the sentential calculus with identity, SCI) since normal B-algebras are just models of this logic. The rest part of the paper is concerned with relationships between some closure systems of filters, SCI B -theories, B-varieties and closed sets of SCI B -equations that have been derived both from the semantics of SCI B and from the semantics of the usual equational logic. (shrink)

It is well known that, in a topological space, the open sets can be characterized using ?lter convergence. In ZF , we cannot replace filters by ultrafilters. It is proven that the ultra?lter convergence determines the open sets for every topological space if and only if the Ultrafilter Theorem holds. More, we can also prove that the Ultra?lter Theorem is equivalent to the fact that uX = kX for every topological space X, where k is the usual Kuratowski closure operator (...) and u is the Ultra?lter Closure with uX := {x ∈ X: [U converges to x and A ∈ U ]}. However, it is possible to built a topological space X for which uX ≠ kX, but the open sets are characterized by the ultra?lter convergence. To do so, it is proved that if every set has a free ultra?lter, then the Axiom of Countable Choice holds for families of non-empty finite sets. It is also investigated under which set theoretic conditions the equality u = k is true in some subclasses of topological spaces, such as metric spaces, second countable T0-spaces or {ℝ}. (shrink)

The contour of a family of filters along a filter is a set-theoretic lower limit. Topologicity and regularity of convergences can be characterized with the aid of the contour operation. Contour inversion is studied, in particular, for iterated contours of sequential cascades. A related problem of continuous extension of maps between maximal elements of sequential cascades to full subcascades is solved in full generality.

This paper gives a formalization of general topology in second-order arithmetic using countably based MF spaces. This formalization is used to study the reverse mathematics of general topology. For each poset P we let MF denote the set of maximal filters on P endowed with the topology generated by {Np | p ∈ P}, where Np = {F ∈ MF | p ∈ F}. We define a countably based MF space to be a space of the form MF for some (...) countable poset P. The class of countably based MF spaces includes all complete separable metric spaces as well as many nonmetrizable spaces. The following reverse mathematics results are obtained. The proposition that every nonempty Gδ subset of a countably based MF space is homeomorphic to a countably based MF space is equivalent to [Formula: see text] over ACA0. The proposition that every uncountable closed subset of a countably based MF space contains a perfect set is equivalent over [Formula: see text] to the proposition that [Formula: see text] is countable for all A ⊆ ℕ. The proposition that every regular countably based MF space is homeomorphic to a complete separable metric space is equivalent to [Formula: see text] over [Formula: see text]. (shrink)

For each integer n ≥ 2, MVn denotes the variety of MV-algebras generated by the MV-chain with n elements. Algebras in MVn are represented as continuous functions from a Boolean space into a n-element chain equipped with the discrete topology. Using these representations, maximal subalgebras of algebras in MVn are characterized, and it is shown that proper subalgebras are intersection of maximal subalgebras. When A ∈ MV3, the mentioned characterization of maximal subalgebras of A can be given in terms of (...) prime filters of the underlying lattice of A, in the form that was conjectured by A. Monteiro. (shrink)

For each integer n ≥ 2, MVn denotes the variety of MV-algebras generated by the MV-chain with n elements. Algebras in MVn are represented as continuous functions from a Boolean space into a n-element chain equipped with the discrete topology. Using these representations, maximal subalgebras of algebras in MVn are characterized, and it is shown that proper subalgebras are intersection of maximal subalgebras. When A ∈ MV3, the mentioned characterization of maximal subalgebras of A can be given in terms of (...) prime filters of the underlying lattice of A, in the form that was conjectured by A. Monteiro. (shrink)

Le but de cet article est de présenter un modèle formel des processus dichotomiques platoniciens. Cette méthode, déjà utilisée dans le Gorgias et décrite dans le Phèdre, reçoit une grande extension dans les dialogues ultérieurs. Elle s'efforce d'obtenir une définition à partir des divisions successives d'un ensemble de concepts. Nous montrons que les chaînes de dichotomies ne fonctionnent pas comme des classifications, mais comme des « filtres convergents » sur l'espace des Idées. Cela veut dire que cet espace est, formellement (...) parlant, un espace topologique compact, donc fini. Mais, dans d'autres textes, Platon semble indiquer que les Idées sont en nombre infini. Dans cette hypothèse, il resterait possible d'atteindre, au moins à l'infini, quelque chose comme une définition, en considérant l'Idée du Bien comme une sorte de principe de compactification de l'univers platonicien. The purpose of this article is to present a formal model of platonician dichotomic processes. This method, already used in Gorgias and described in Phaedrus, takes a great development in further dialogues. It tries to get a definition from successive divisions of a set of concepts. We show that the chains of dichotomies do not work as classifications but as "convergent filters "on the space of Ideas. It means that this space is, formally speaking, a compact and therefore, finite, topological space. But in some other texts, Platon seems to specify that there is an infinite number of Ideas. In this case, it will remain possible to reach, at least in the infinite, something like a definition, by regarding the Idea of Good as a sort of compactness principle of the platonician universe. (shrink)

By analyzing how one obtains the Stone space of the reduced product of an indexed collection of Boolean algebras from the Stone spaces of those algebras, we derive a topological construction, the "reduced coproduct", which makes sense for indexed collections of arbitrary Tichonov spaces. When the filter in question is an ultrafilter, we show how the "ultracoproduct" can be obtained from the usual topological ultraproduct via a compactification process in the style of Wallman and Frink. We prove theorems dealing (...) with the topological structure of reduced coproducts (especially ultracoproducts) and show in addition how one may use this construction to gain information about the category of compact Hausdorff spaces. (shrink)

A systematic approach to the algebraic and Kripke semantics for logics with restricted structural rules, notably for logics on an underlying non-distributive lattice, is developed. We provide a new topological representation theorem for general lattices, using the filter space X. Our representation involves a galois connection on subsets of X, hence a closure operator $\Gamma$, and the image of the representation map is characterized as the collection of $\Gamma$-stable, compact-open subsets of the filter space . The original lattice (...) ${\cal L}$ is thus imbedded in the complete lattice of stable sets. The representation is shown to be functorial and is extended to a Stone-type duality. ;In the presence of additional operators, the extension problem is addressed in terms of what we call adjoint completions of normal operators. An operator f on a lattice L is normal if f: $L\sp{} \times \cdots \times L\sp{} \to L\sp{}$ is a monotone map, where each $L\sp{}$, $i \in n$ + 1, is either L or $L\sp{op}$ and f sends finite joins of $L\sp{}$ to joins in $L\sp{}$. Every familiar operator, such as $\circ$ , + , $\gets, \to, \neg, \square$ O is normal. By a uniform argument we show that normal operators $f\sb{i}$ on L extend to operators $F\sb{i}$ on $\Gamma X$ that distribute over arbitrary joins or meets and that \sb{i\in I})$ is a universal such extension. ;We also raise and resolve the question of representability of operators on stable sets by relations. We give an extensive number of examples of representation of specific operators and provide explicit constructions of canonical Kripke frames, based on our extension arguments, for a number of logical systems, notably for Intuitionistic and Classical Linear Logics, or Non-commutative Linear Logic and of fragments thereof. (shrink)

The IKt-algebras were introduced in the paper An algebraic axiomatization of the Ewald’s intuitionistic tense logic by the first and third author. In this paper, our main interest is to investigate the principal and Boolean congruences on IKt-algebras. In order to do this we take into account a topological duality for these algebras obtained in Figallo et al. :673–701, 2017). Furthermore, we characterize Boolean and principal IKt-congruences and we show that Boolean IKt-congruence are principal IKt-congruences. Also, bearing in mind the (...) above results, we obtain that Boolean IKt-congruences are commutative, regular and uniform. Finally, we characterize the principal IKt-congruences in the case that the IKt-algebra is linear and complete whose prime filters are complete and also the case that it is linear and finite. This allowed us to establish that the intersection of two principal IKt-congruences on these algebras is a principal one and also to determine necessary and sufficient conditions so that a principal IKt-congruence is a Boolean one on theses algebras. (shrink)