Characterizations of maximal consistent theories in the formal deductive system (NM-logic) and Cantor space

2007 ◽  
Vol 158 (23) ◽  
pp. 2591-2604 ◽  
Author(s):  
Hongjun Zhou ◽  
Guojun Wang
2020 ◽  
Vol 70 (6) ◽  
pp. 1259-1274

AbstractThe theory of fuzzy deductive systems in RM algebras is developed. Various characterizations of fuzzy deductive systems are given. It is proved that the set of all fuzzy deductive systems of a RM algebra 𝒜 is a complete lattice (it is distributive if 𝒜 is a pre-BBBCC algebra). Some characterizations of Noetherian RM algebras by fuzzy deductive systems are obtained. In pre-BBBZ algebras, the fuzzy deductive system generated by a fuzzy set is constructed. Finally, closed fuzzy deductive systems are defined and studied. It is showed that in finite CI and pre-BBBZ algebras, every fuzzy deductive system is closed. Moreover, the homomorphic properties of (closed) fuzzy deductive systems are provided.


1998 ◽  
Vol 34 (1) ◽  
pp. 73-124 ◽  
Author(s):  
RUTH KEMPSON ◽  
DOV GABBAY

This paper informally outlines a Labelled Deductive System for on-line language processing. Interpretation of a string is modelled as a composite lexically driven process of type deduction over labelled premises forming locally discrete databases, with rules of database inference then dictating their mode of combination. The particular LDS methodology is illustrated by a unified account of the interaction of wh-dependency and anaphora resolution, the so-called ‘cross-over’ phenomenon, currently acknowledged to resist a unified explanation. The shift of perspective this analysis requires is that interpretation is defined as a proof structure for labelled deduction, and assignment of such structure to a string is a dynamic left-right process in which linearity considerations are ineliminable.


2009 ◽  
Vol 74 (3) ◽  
pp. 780-810 ◽  
Author(s):  
Nikolaos Galatos ◽  
Constantine Tsinakis

AbstractEquivalences and translations between consequence relations abound in logic. The notion of equivalence can be denned syntactically, in terms of translations of formulas, and order-theoretically, in terms of the associated lattices of theories. W. Blok and D. Pigozzi proved in [4] that the two definitions coincide in the case of an algebraizable sentential deductive system. A refined treatment of this equivalence was provided by W. Blok and B. Jónsson in [3]. Other authors have extended this result to the cases of κ-deductive systems and of consequence relations on associative, commutative, multiple conclusion sequents. Our main result subsumes all existing results in the literature and reveals their common character. The proofs are of order-theoretic and categorical nature.


2014 ◽  
Vol 7 (3) ◽  
pp. 439-454 ◽  
Author(s):  
PHILIP KREMER

AbstractIn the topological semantics for propositional modal logic, S4 is known to be complete for the class of all topological spaces, for the rational line, for Cantor space, and for the real line. In the topological semantics for quantified modal logic, QS4 is known to be complete for the class of all topological spaces, and for the family of subspaces of the irrational line. The main result of the current paper is that QS4 is complete, indeed strongly complete, for the rational line.


1987 ◽  
Vol 52 (3) ◽  
pp. 817-818 ◽  
Author(s):  
Randall Dougherty

A subset of the Cantor space ω2 is called monotone iff it is closed upward under the partial ordering ≤ defined by x ≤ y iff x(n) ≤ y(n) for all n ∈ ω. A set is -positive (-positive) iff it is monotone and -positive set is a countable union of -positive sets; a -positive set is a countable intersection of -positive sets. (See Cenzer [2] for background information on these concepts.) It is clear that any -positive set is and monotone; the converse holds for n ≤ 2 [2] and was conjectured by Dyck to hold for greater n. In this note, we will disprove this conjecture by giving examples of monotone sets (for n ≥ 3) which are not even -positive.First we note a few isomorphisms. The space (ω2, ≤) is isomorphic to the space (ω2 ≥), so instead of monotone and positive sets we may construct hereditary and negative sets (the analogous notions with “closed upward” replaced by “closed downward”). Also, (ω2, ≤) is isomorphic to ((ω), ⊆), where denotes the power set operator, or to ((S), ⊆) for any countably infinite set S.In order to remove extraneous notation from the proofs, we state the results in an abstract form (whose generality is deceptive).


2018 ◽  
Vol 15 (19) ◽  
pp. 247-264
Author(s):  
Inocêncio Fernandes Balieiro Filho

O presente artigo tem por objetivo discutir numa perspectiva contemporânea os conteúdos de Lógica, Matemática, Filosofia da Matemática e História da Matemática presentes no livro A Lógica na Matemática, escrito por Malba Tahan. Para isso, mediante o uso da historiografia, foram selecionados temas concernentes com os assuntos da pesquisa. Foram tratados os seguintes temas: a base lógica da Matemática, a definição de conceito, os princípios para se definir um objeto, as definições e a natureza dos axiomas em Matemática, o método axiomático e as diversas axiomáticas para a geometria euclidiana, a estrutura lógica de um sistema dedutivo, os métodos de demonstração em Matemática, a indução, analogia e dedução em Matemática.   Palavras-chave: Lógica Matemática; História da Matemática; Filosofia da Matemática.   A TOUR BY THE LABYRINTH OF MATHEMATICAL LOGIC IN THE COMPANY OF MALBA TAHAN   Abstract   In this paper we discuss the Mathematics, the Logic of Mathematics, the Philosophy and History of Mathematics that presents in the book A Lógica na Matemática of the Malba Tahan, in a contemporary approach. For that, we use the historiography to select matters in adherence with the research. Are treated this topics: the basis of the Logic of Mathematics; the concept definition; principles to define an object; definitions and nature of the axioms in Mathematics; the axiomatic method and the diverse axiomatic to the Euclidean Geometry; the logical structure of a deductive system; demonstration methods in mathematics; the induction, analogy and deduction in mathematics.  


Author(s):  
COLIN D. REID

Abstract We show that, given a compact minimal system $(X,g)$ and an element h of the topological full group $\tau [g]$ of g, the infinite orbits of h admit a locally constant orientation with respect to the orbits of g. We use this to obtain a clopen partition of $(X,G)$ into minimal and periodic parts, where G is any virtually polycyclic subgroup of $\tau [g]$ . We also use the orientation of orbits to give a refinement of the index map and to describe the role in $\tau [g]$ of the submonoid generated by the induced transformations of g. Finally, we consider the problem, given a homeomorphism h of the Cantor space X, of determining whether or not there exists a minimal homeomorphism g of X such that $h \in \tau [g]$ .


2008 ◽  
Vol 73 (3) ◽  
pp. 933-939 ◽  
Author(s):  
Josef Berger

AbstractWe prove constructively that the weak König lemma and quantifier-free number–number choice imply that every pointwise continuous function from Cantor space into Baire space has a modulus of uniform continuity.


Sign in / Sign up

Export Citation Format

Share Document