In this paper, we prove that the lattice of all closure operators of a complete Almost Distributive Lattice L with fixed maximal element m is dual atomistic. We define the concept of a completely meet-irreducible element in a complete ADL and derive a necessary and sufficient condition for a dual atom of Φ (L) to be complemented.

In this paper, a theorem on the existence of complete embedding of partially ordered monoids into complete residuated lattices is shown. From this, many interesting results on residuated lattices and substructural logics follow, including various types of completeness theorems of substructural logics.

In this paper, a theorem on the existence of complete embedding of partially ordered monoids into complete residuated lattices is shown. From this, many interesting results on residuated lattices and substructural logics follow, including various types of completeness theorems of substructural logics.

We continue the work of Blok and Jónsson by developing the theory of structural closure operators and introducing the notion of a representation between them. Similarities and equivalences of Blok-Jónsson turn out to be bijective representations and bijective structural representations, respectively. We obtain a characterization for representations induced by a transformer. In order to obtain a similar characterization for structural representations we introduce the notions of a graduation and a graded variable of an M-set. We show that several deductive (...) systems, Gentzen systems among them, are graded M-sets having graded variables, and describe the graded variables in each case. In the last section we show that, for a sentential logic, having an algebraic semantics is equivalent to being representable in an equational consequence. This motivates the extension of the notion of having an algebraic semantics for Gentzen systems, hypersequents systems, etc. We prove that if a closure operator is representable by a transformer, then every extension of it is also representable by the same transformer. As a consequence we obtain that if one of these systems has an algebraic semantics, then so does any of its extensions with the same defining equations. (shrink)

In the paper, tracing the traditional Hilbert-style syntactic account of logics, a syntactic characteristic of a closure operation defined on a complete lattice follows. The approach is based on observation that the role of rule of inference for a given consequence operation may be played by an ordinary binary relation on the complete lattice on which the closure operation is defined.

In this paper we develop the notion of formal precover in a topos by defining a relation between elements and sets in a local set theory. We show that such relations are equivalent to modalities and to universal closure operators. Finally we prove that these relations are well characterized by a convenient restriction to a particular set.

In our previous paper Algebraic Logic for Classical Conjunction and Disjunction we studied some relations between the fragmentL of classical logic having just conjunction and disjunction and the varietyD of distributive lattices, within the context of Algebraic Logic. The central tool in that study was a class of closure operators which we calleddistributive, and one of its main results was that for any algebraA of type (2,2) there is an isomorphism between the lattices of allD-congruences ofA and of all (...) distributive closure operators overA. In the present paper we study the lattice structure of this last set, give a description of its finite and infinite operations, and obtain a topological representation. We also apply the mentioned isomorphism and other results to obtain proofs with a logical flavour for several new or well-known lattice-theoretical properties, like Hashimoto's characterization of distributive lattices, and Priestley's topological representation of the congruence lattice of a bounded distributive lattice. (shrink)

We introduce a new logical operator CSTC and show that incorporating this operator into first-order logic enables as to capture the complexity class PSPACE. We also show that by varying how the operator is applied we can capture the complexity classes P, NP, the classes of the Polynomial Hierarchy PH, and PSPACE. As such, the operator CSTC can be regarded as a general purpose operator. We also give applications of these characterizations by showing that P (...) and NP coincide with those problems accepted by two new classes of program schemes , by producing some new complete problems for various complexity classes where the reductions are from first principles and do not use known complete problems , and by giving a simple proof that first-order logic incorporated with the least fixed point operator captures P. (shrink)

ABSTRACT In this work the connections between the fuzzy closure operators and the graded consequence relations are examined Namely, as it is well known, in the crisp case there is a complete equivalence between the notion of closure operator and the one of consequence relation. We extend this result by proving that the graded consequence relations are related to a particular class of fuzzy closure operators, namely the class of fuzzy closure operators that can be (...) obtained by a chain of classical closure operators. (shrink)

In this article we introduce and study the notion of operational closure: a transitive set d is called operationally closed iff it contains all constants of OST and any operation f∈d applied to an element a∈d yields an element fa∈d, provided that f applied to a has a value at all. We will show that there is a direct relationship between operational closure and stability in the sense that operationally closed sets behave like Σ1 substructures of the universe. (...) This leads to our final result that OST plus the axiom , claiming that any set is element of an operationally closed set, is proof-theoretically equivalent to the system KP+ of Kripke–Platek set theory with infinity and Σ1 separation. We also characterize the system OST plus the existence of one operationally closed set in terms of Kripke–Platek set theory with infinity and a parameter-free version of Σ1 separation. (shrink)

Attempts to define life should focus on the transition from molecules to cells and the “closure” aspects of this event. Rather than classifying existing objects into living and non-living entities I believe the challenge is to understand how the transition from non-life to life can take place, that is, the how the closure in Jagers op Akkerhuis’s hierarchical classification of operators, comes about.

Constructive set theory a' la Myhill-Aczel has been extended in (Cantini and Crosilla 2008, Cantini and Crosilla 2010) to incorporate a notion of (partial, non--extensional) operation. Constructive operational set theory is a constructive and predicative analogue of Beeson's Inuitionistic set theory with rules and of Feferman's Operational set theory (Beeson 1988, Feferman 2006, Jaeger 2007, Jaeger 2009, Jaeger 1009b). This paper is concerned with an extension of constructive operational set theory (Cantini and Crosilla 2010) by a uniform operation of Transitive (...) Closure, \tau. Given a set a, \tau produces its transitive closure \tau a. We show that the theory ESTE of (Cantini and Crosilla 2010) augmented by \tau is still conservative over Peano Arithmetic. (shrink)

In the categorical approach to the foundations of quantum theory, one begins with a symmetric monoidal category, the objects of which represent physical systems, and the morphisms of which represent physical processes. Usually, this category is taken to be at least compact closed, and more often, dagger compact, enforcing a certain self-duality, whereby preparation processes (roughly, states) are interconvertible with processes of registration (roughly, measurement outcomes). This is in contrast to the more concrete “operational” approach, in which the states and (...) measurement outcomes associated with a physical system are represented in terms of what we here call a convex operational model: a certain dual pair of ordered linear spaces–generally, not isomorphic to one another. On the other hand, state spaces for which there is such an isomorphism, which we term weakly self-dual, play an important role in reconstructions of various quantum-information theoretic protocols, including teleportation and ensemble steering. In this paper, we characterize compact closure of symmetric monoidal categories of convex operational models in two ways: as a statement about the existence of teleportation protocols, and as the principle that every process allowed by that theory can be realized as an instance of a remote evaluation protocol—hence, as a form of classical probabilistic conditioning. In a large class of cases, which includes both the classical and quantum cases, the relevant compact closed categories are degenerate, in the weak sense that every object is its own dual. We characterize the dagger-compactness of such a category (with respect to the natural adjoint) in terms of the existence, for each system, of a symmetric bipartite state, the associated conditioning map of which is an isomorphism. (shrink)

The Baire algebra of a topological space X is the quotient of the algebra of all subsets of X modulo the meager sets. We show that this Boolean algebra can be endowed with a natural closure operator, resulting in a closure algebra which we denote $\mathbf {Baire}(X)$. We identify the modal logic of such algebras to be the well-known system $\mathsf {S5}$, and prove soundness and strong completeness for the cases where X is crowded and either completely (...) metrizable and continuum-sized or locally compact Hausdorff. We also show that every extension of $\mathsf {S5}$ is the modal logic of a subalgebra of $\mathbf {Baire}(X)$, and that soundness and strong completeness also holds in the language with the universal modality. (shrink)

The principle of epistemic closure is the claim that what is known to follow from knowledge is known to be true. This intuitively plausible idea is endorsed by a vast majority of knowledge theorists. There are significant problems, however, that have to be addressed if epistemic closure – closed knowledge – is endorsed. The present essay locates the problem for closed knowledge in the separation it imposes between knowledge and evidence. Although it might appear that all that stands (...) between knowing the truth of the premises of a valid inference and knowledge of its conclusion is inferring it from the premises, the evidence for each of the premises may jointly count against the conclusion. The intuitive view regarding inferred knowledge says one thing, the evidence says another. One epistemological framework that seems to have the resources to resolve this tension endorses the view that knowledge always requires conclusive evidence. A second framework resolves the tension by limiting the scope of the closure principle. Only inferences drawn directly from propositions contained in the scope of a single knowledge operator are considered closed. The aim of the present essay is to revive the unpopular third option, the idea that knowledge is open. The essay proceeds by arguing that in different ways the two former frameworks only succeed in relocating the problem, not in resolving it. The first framework, the infallibilist view, relocates the problem to a sharp separation between knowledge of the occurrences of events from knowledge of their chance of occurring, a separation leading to several significant additional problems. The fallibilist view, the second framework, in endorsing closure neglects to take into full account the ways in which evidence fails to be transitive. For instance, evidence can count in favor of a conjunction while counting against each of its conjuncts. This fact, which is argued for in the essay on probabilistic as well as non-probabilistic grounds, is used as the foundation of an argument against closed knowledge that can be used as a way to understand several of the most fundamental challenges of epistemology. Not only can an open knowledge view that is based on open evidence resolve all these problems in a simple and natural way, it can also respond to formidable challenges that significantly hinder other open knowledge views. There are good reasons, then, to view both knowledge and evidence as open. (shrink)

In this paper, I consider the connection between consequence relations and closure operations. I argue that one familiar connection makes good sense of some usual applications of consequence relations, and that a largeish family of familiar noncontractive consequence relations cannot respect this familiar connection.

In this paper, notions of fuzzy closure system and fuzzy closure L—system on L—ordered sets are introduced from the fuzzy point of view. We first explore the fundamental properties of fuzzy closure systems. Then the correspondence between fuzzy closure systems and fuzzy closure operators is established. Finally, we study the connections between fuzzy closure systems and fuzzy Galois connections. © 2011 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

A dispute in epistemology has arisen over whether some class of things epistemic (things known or justified, for example) is closed under some operation involving the notion of what follows deductively from members of this class. Very few philosophers these days believe that if you know that p, and p entails q, then you know that q. But many philosophers think that something weaker holds, for instance that if you know that p, and p entails q, then you are in (...) a position to know that p, or if you know that p and you competently deduce p from q, then you know that q. However there are some considerations tracing back to Wittgenstein’s On Certainty and some early work by Fred Dretske that suggests even these weaker principles are false. (shrink)

We establish a general hierarchy theorem for quantifier classes in the infinitary logic L∞ωωon finite structures. In particular, it is shown that no infinitary formula with bounded number of universal quantifiers can express the negation of a transitive closure.This implies the solution of several open problems in finite model theory: On finite structures, positive transitive closure logic is not closed under negation. More generally the hierarchy defined by interleaving negation and transitive closure operators is strict. This proves (...) a conjecture of Immerman.We also separate the expressive power of several extensions of Datalog, giving new insight in the fine structure of stratified Datalog. (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)

There is no known syntactic characterization of the class of finite definitions in terms of a set of basic definitions and a set of basic operators under which the class is closed. Furthermore, it is known that the basic propositional operators do not preserve finiteness. In this paper I survey these problems and explore operators that do preserve finiteness. I also show that every definition that uses only unary predicate symbols and equality is bound to be finite.

It is known that a semantically closed theory with description may well be trivial if the principles concerning denotation and descriptions are formulated in certain ways, even if the underlying logic is paraconsistent. This paper establishes the nontriviality of a semantically closed theory with a natural, but non-extensional, description operator.

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 general principle of epistemic closure stipulates that epistemic properties are transmissible through logical means. According to this principle, an epistemic operator, say ε, should satisfy any valid scheme of inference, such as: if ε(p entails q), then ε(p) entails ε(q). The principle of epistemic closure under known entailment (ECKE), a particular instance of epistemic closure, has received a good deal of attention since the last thirty years or so. ECKE states that: if one knows that (...) p entails q, and she knows that p, then she knows that q. It is widely accepted that ECKE constitutes an important piece of the skeptical argument, but the acceptance of an unrestricted version of ECKE is still a matter of debate. On the side of the defenders of ECKE, one finds Stine (1976), Brueckner (1985), Vogel (1990), and Feldman (1995). Others proposed a refutation or a limitation of the principle, like Dretske (1970), Nozick (1981), Hales (1995), Williams (1996), and Sosa (1999). As it turns out, the relevant alternatives view (RAV) elaborated by Dretske, which restricts the scope of ECKE, has been discussed extensively and acknowledged as one of the most important contributions. There is nonetheless a major unsolved difficulty pertaining to Dretske-RAV: the notion of relevant alternatives is defined in such a way that it is bounded by counterfactual possibilities. This ontological import leaves open the door to the skeptic. Some have tried to give more precision to this notion, like Stine (1976), who appealed to a Gricean approach to define relevant alternatives in conversational contexts. My proposal is in accordance with the gist of Dretske’s strategy, i.e. to restrict the validity of ECKE, and I claim that in order to escape the difficulties inherent to RAV one has to introduce a more robust notion, the notion of epistemic context. Epistemic contexts are a subclass of propositional contexts. In that perspective, the closure property is expressed in terms of a property of a relation between epistemic contexts. ECKE holds when and only when either the epistemic context of the premisses is the same as the epistemic context of the conclusion, or the epistemic context change between the premisses and the conclusion is permissible. Permissibility of epistemic context change is a function of consistency. By means of this epistemic context approach, I will show that: (1) epistemic contexts are defined by basic propositions (unchallenged justified beliefs), (2) ECKE holds only under very specific constraints, and (3) the skeptical argument involves a non-permissible change of epistemic context and, by the same token, cannot rely upon ECKE. (shrink)

All standard epistemic logics legitimate something akin to the principle of closure, according to which knowledge is closed under competent deductive inference. And yet the principle of closure, particularly in its multiple premise guise, has a somewhat ambivalent status within epistemology. One might think that serious concerns about closure point us away from epistemic logic altogether—away from the very idea that the knowledge relation could be fruitfully treated as a kind of modal operator. This, however, need (...) not be so. The abandonment of closure may yet leave in place plenty of formal structure amenable to systematic logical treatment. In this paper we describe a family of weak epistemic logics in which closure fails, and describe two alternative semantic frameworks in which these logics can be modelled. One of these—which we term plurality semantics—is relatively unfamiliar. We explore under what conditions plurality frames validate certain much-discussed principles of epistemic logic. It turns out that plurality frames can be interpreted in a very natural way in light of one motivation for rejecting closure, adding to the significance of our technical work. The second framework that we employ—neighbourhood semantics—is much better known. But we show that it too can be interpreted in a way that comports with a certain motivation for rejecting closure. (shrink)

Graham and Maitzen think my CORNEA principle is in trouble because it entails “intolerable violations of closure under known entailment.” I argue that the trouble arises from current befuddlement about closure itself, and that a distinction drawn by Rudolph Carnap, suitably extended, shows how closure, when properly understood, works in tandem with CORNEA. CORNEA does not obey Closure because it shouldn’t: it applies to “dynamic” epistemic operators, whereas closure principles hold only for “static” ones. What (...) the authors see as an intolerable vice of CORNEA is actually a virtue, helping us see what closure principles should—and shouldn’t—themselves be about. (shrink)

Las paradojas semánticas muestran que las teorías semánticas que internalizan sus propios conceptos semánticos, como la verdad y la validez, no pueden validar toda la lógica clásica. Es decir, es necesario debilitar algún conectivo del lenguaje objeto, tomado como culpable de las paradojas, o renunciar a alguna propiedad de la relación de consecuencia de la teoría lógica. Ambas estrategias pueden alejarnos de la lógica clásica, que es la lógica comúnmente utilizada en nuestras teorías matemáticas actuales. Por tanto, una solución deseable (...) a las paradojas semánticas no debería alejarnos de la lógica clásica. En este trabajo analizamos dos propuestas interesantes que pretenden mantener la lógica clásica al máximo posible. La primera estrategia, Barrio & Pailos & Szmuc-approach (2017) (BPS-approach), propone la lógica paraconsistente MSC que contiene en su lenguaje objeto un conectivo capaz de recuperar la inferencia clásica siempre que las oraciones en cuestión sean consistentes. Así, muestran que es posible construir una teoría semántica sobre esta lógica que sea inmune a las paradojas semánticas. El segundo enfoque se basa en la jerarquia STω de sistemas no transitivos STn, propuesta por Pailos (2020a). Esta jerarquía recupera tantas metainferencias clásicas como sea posible en los niveles superiores de la jerarquía. Argumentamos a favor del segundo enfoque, argumentando que la primera estrategia tiene que adoptar procedimientos autorreferenciales débiles para evitar las paradojas. (shrink)

Sanford Goldberg’s account of epistemic coverage constitutes a special case of Douglas Walton’s view that epistemic closure arises from dialectical argument. Walton’s pragmatic version of epistemic closure depends on dialectical norms for closing an argument, and epistemic coverage operates at the limits of argument closure because it minimizes dialectical exchange. Such closure works together with a shared hypothetical consideration to justify dismissal of surprising claims.

The author considers the model-theoretic character of proofs and disproofs by means of attempted counterexample constructions, distinguishes this proof format from formal derivations, then contrasts two approaches to semantic tableaux proposed by Beth and Lambert-van Fraassen. It is noted that Beth's original approach has not as yet been provided with a precisely formulated rule of closure for detecting tableau sequences terminating in contradiction. To remedy this deficiency, a technique is proposed to clarify tableau operations.

This paper has two main purposes. First, it will provide an introductory discussion of hyperset theory, and show that it is useful for modeling complex systems. Second, it will use hyperset theory to analyze Robert Rosen’s metabolismrepair systems and his claim that living things are closed to efficient cause. It will also briefly compare closure to efficient cause to two other understandings of autonomy, operational closure and catalytic closure.

Does a factive conception of knowability figure in ordinary use? There is some reason to think so. ‘Knowable’ and related terms such as ‘discoverable’, ‘observable’, and ‘verifiable’ all seem to operate factively in ordinary discourse. Consider the following example, a dialog between colleagues A and B: A: We could be discovered. B: Discovered doing what? A: Someone might discover that we're having an affair. B: But we are not having an affair! A: I didn’t say that we were. A’s remarks (...) sound contradictory. In this context the factivity of ‘someone might discover that’ explains this fact. So there is some reason to believe that knowability and related modalities are factive in ordinary use. For factive treatments of knowability in the context of epistemic theories of truth, compare Tennant (2000: 829) and Wright (2001: 59-60, n. 17). (shrink)

The main result of this paper is the following theorem: a closure space X has an , , Q-regular base of the power iff X is Q-embeddable in It is a generalization of the following theorems:(i) Stone representation theorem for distributive lattices ( = 0, = , Q = ), (ii) universality of the Alexandroff's cube for T 0-topological spaces ( = , = , Q = 0), (iii) universality of the closure space of filters in the lattice (...) of all subsets for , -closure spaces (Q = 0). By this theorem we obtain some characterizations of the closure space given by the consequence operator for the classical propositional calculus over a formalized language of the zero order with the set of propositional variables of the power . In particular we prove that a countable closure space X is embeddable with finite disjunctions preserved into F iff X is a consistent closure space satisfying the compactness theorem and X contains a 0, -base consisting of -prime sets. (shrink)

Any set x is uniquely specified by the graph of the membership relation on the set obtained by adjoining x to the transitive closure of x. Thus any operation on sets can be looked at as an operation on these graphs. We look at the operations of ordinal arithmetic of sets in this light. This turns out to be simplest for a modified ordinal arithmetic based on the Zermelo ordinals, instead of the usual von Neumann ordinals. In this arithmetic, (...) addition of sets corresponds to concatenating graphs, and multiplication corresponds to replacing each edge of a graph by a copy of another graph. Characterizations for the von Neumann case are also given. (shrink)

The aim of this paper is to investigate the variety of symmetric closure algebras, that is, closure algebras endowed with a De Morgan operator. Some general properties are derived. Particularly, the lattice of subvarieties of the subvariety of monadic symmetric algebras is described and an equational basis for each subvariety is given.

A new modal logic is introduced. It describes properties of provability by interpreting modality as a deductive closure operator on sets of formulas. Logic is proven to be decidable and complete with respect to this semantics.

“Small” large cardinal notions in the language of ZFC are those large cardinal notions that are consistent with V = L. Besides their original formulation in classical set theory, we have a variety of analogue notions in systems of admissible set theory, admissible recursion theory, constructive set theory, constructive type theory, explicit mathematics and recursive ordinal notations (as used in proof theory). On the face of it, it is surprising that such distinctively set-theoretical notions have analogues in such disaparate and (...) relatively constructive contexts. There must be an underlying reason why that is possible (and, incidentally, why “large” large cardinal notions have not led to comparable analogues). My long term aim is to develop a common language in which such notions can be expressed and can be interpreted both in their original classical form and in their analogue form in each of these special constructive and semi-constructive cases. This is a program in progress. What is done here, to begin with, is to show how that can be done to a considerable extent in the settings of classical and admissible set theory (and thence, admissible recursion theory). The approach taken here is to expand the language of set theory to allow us to talk about (possibly partial) operations applicable both to sets and to operations and to formulate the large cardinal notions in question in terms of operational closure conditions; at the same time only minimal existence axioms are posited for sets. The resulting system, called Operational Set Theory, is a partial adaptation to the set-theoretical framework of the explicit mathematics framework Feferman (1975). The.. (shrink)