1 |
Subvariedades de álgebras de semi-HeytingCornejo, Juan Manuel 17 November 2011 (has links)
Las álgebras de semi-Heyting fueron introducidas como una nueva clase ecuacional por H. P. Sankappanavar en [33]. Éstas álgebras representan un generalizacióon de las álgebras
de Heyting. Si bien la manera de definir la axiomáatica para una clase u otra es casi la misma, de hecho difieren en un só-lo axioma, el comportamiento entre las variedades es distinto y hace rico el trabajo de estudiar cuáles son las propiedades que se extienden a las álgebras de semi-Heyting y cuáles no. / Semi-Heyting algebras were introduced as a new equational class by H. P. Sankappanavar en [33]. These algebras represent a generalization of Heyting algebras. In fact, their definition can be obtain from a certain axiomatic of Heyting algebras replacing one of the axioms by a weaker one. Nevertheless, as we will see, the behavior of semi-Heyting algebras is much more complicated than that of Heyting algebras.
|
2 |
Lógica de topos e aplicações / Topos logic and applicationsCahali, Arthur Francisco Schwerz 12 June 2019 (has links)
A primeira noção de topos, a de topos de Grothendieck, surgiu há cerca de 50 anos a partir de uma generalização do conceito de feixe na geometria algébrica. Poucos anos mais tarde, uma axiomatização categorial de algumas das propriedades de um topos de Grothendieck deu origem a uma segunda noção de topos, a de topos elementar; e essa descrição permitiu estabelecer ligações entre essas categorias e teoria dos conjuntos e lógica. Neste trabalho, estudamos a teoria de topos com um foco especial na construção da lógica interna dos topoi, e exploramos sua relação com modelos Heyting-valorados. / The first definition of a topos, that of a Grothendieck topos, emerged roughly 50 years ago from a generalization of the notion of sheaves in algebraic geometry. Few years later, a categorical axiomatization of some properties of Grothendieck topoi gave rise to a second notion of topoi, that of an elementary topos; and this description made it possible to establish connections between these categories and set theory and logic. In this work, we study topos theory with a particular focus on the construction of the internal logic of topoi, and explore its relation to Heyting-valued models.
|
3 |
An algebraic study of modal operators on Heyting algebras with applications to topology and sheafificationMacnab, Donald Sidney January 1976 (has links)
No description available.
|
4 |
Sheaves of Structures, Heyting-Valued Structures, and a Generalization of Łoś's Theorem / 構造の層・Heyting値構造とŁośの定理の一般化Aratake, Hisashi 26 July 2021 (has links)
京都大学 / 新制・課程博士 / 博士(理学) / 甲第23402号 / 理博第4737号 / 新制||理||1679(附属図書館) / 京都大学大学院理学研究科数学・数理解析専攻 / (主査)准教授 照井 一成, 教授 牧野 和久, 教授 長谷川 真人 / 学位規則第4条第1項該当 / Doctor of Science / Kyoto University / DGAM
|
5 |
The complete Heyting algebra of subsystems and contextualityVourdas, Apostolos January 2013 (has links)
no / The finite set of subsystems of a finite quantum system with variables in Z(n), is studied as a Heyting algebra. The physical meaning of the logical connectives is discussed. It is shown that disjunction of subsystems is more general concept than superposition. Consequently, the quantum probabilities related to commuting projectors in the subsystems, are incompatible with associativity of the join in the Heyting algebra, unless if the variables belong to the same chain. This leads to contextuality, which in the present formalism has as contexts, the chains in the Heyting algebra. Logical Bell inequalities, which contain "Heyting factors," are discussed. The formalism is also applied to the infinite set of all finite quantum systems, which is appropriately enlarged in order to become a complete Heyting algebra.
|
6 |
A Natural Interpretation of Classical ProofsBrage, Jens January 2006 (has links)
<p>In this thesis we use the syntactic-semantic method of constructive type theory to give meaning to classical logic, in particular Gentzen's LK.</p><p>We interpret a derivation of a classical sequent as a derivation of a contradiction from the assumptions that the antecedent formulas are true and that the succedent formulas are false, where the concepts of truth and falsity are taken to conform to the corresponding constructive concepts, using function types to encode falsity. This representation brings LK to a manageable form that allows us to split the succedent rules into parts. In this way, every succedent rule gives rise to a natural deduction style introduction rule. These introduction rules, taken together with the antecedent rules adapted to natural deduction, yield a natural deduction calculus whose subsequent interpretation in constructive type theory gives meaning to classical logic.</p><p>The Gentzen-Prawitz inversion principle holds for the introduction and elimination rules of the natural deduction calculus and allows for a corresponding notion of convertibility. We take the introduction rules to determine the meanings of the logical constants of classical logic and use the induced type-theoretic elimination rules to interpret the elimination rules of the natural deduction calculus. This produces an interpretation injective with respect to convertibility, contrary to an analogous translation into intuitionistic predicate logic.</p><p>From the interpretation in constructive type theory and the interpretation of cut by explicit substitution, we derive a full precision contraction relation for a natural deduction version of LK. We use a term notation to formalize the contraction relation and the corresponding cut-elimination procedure.</p><p>The interpretation can be read as a Brouwer-Heyting-Kolmogorov (BHK) semantics that justifies classical logic. The BHK semantics utilizes a notion of classical proof and a corresponding notion of classical truth akin to Kolmogorov's notion of pseudotruth. We also consider a second BHK semantics, more closely connected with Kolmogorov's double-negation translation.</p><p>The first interpretation reinterprets the consequence relation while keeping the constructive interpretation of truth, whereas the second interpretation reinterprets the notion of truth while keeping the constructive interpretation of the consequence relation. The first and second interpretations act on derivations in much the same way as Plotkin's call-by-value and call-by-name continuation-passing-style translations, respectively.</p><p>We conclude that classical logic can be given a constructive semantics by laying down introduction rules for the classical logical constants. This semantics constitutes a proof interpretation of classical logic.</p>
|
7 |
A Natural Interpretation of Classical ProofsBrage, Jens January 2006 (has links)
In this thesis we use the syntactic-semantic method of constructive type theory to give meaning to classical logic, in particular Gentzen's LK. We interpret a derivation of a classical sequent as a derivation of a contradiction from the assumptions that the antecedent formulas are true and that the succedent formulas are false, where the concepts of truth and falsity are taken to conform to the corresponding constructive concepts, using function types to encode falsity. This representation brings LK to a manageable form that allows us to split the succedent rules into parts. In this way, every succedent rule gives rise to a natural deduction style introduction rule. These introduction rules, taken together with the antecedent rules adapted to natural deduction, yield a natural deduction calculus whose subsequent interpretation in constructive type theory gives meaning to classical logic. The Gentzen-Prawitz inversion principle holds for the introduction and elimination rules of the natural deduction calculus and allows for a corresponding notion of convertibility. We take the introduction rules to determine the meanings of the logical constants of classical logic and use the induced type-theoretic elimination rules to interpret the elimination rules of the natural deduction calculus. This produces an interpretation injective with respect to convertibility, contrary to an analogous translation into intuitionistic predicate logic. From the interpretation in constructive type theory and the interpretation of cut by explicit substitution, we derive a full precision contraction relation for a natural deduction version of LK. We use a term notation to formalize the contraction relation and the corresponding cut-elimination procedure. The interpretation can be read as a Brouwer-Heyting-Kolmogorov (BHK) semantics that justifies classical logic. The BHK semantics utilizes a notion of classical proof and a corresponding notion of classical truth akin to Kolmogorov's notion of pseudotruth. We also consider a second BHK semantics, more closely connected with Kolmogorov's double-negation translation. The first interpretation reinterprets the consequence relation while keeping the constructive interpretation of truth, whereas the second interpretation reinterprets the notion of truth while keeping the constructive interpretation of the consequence relation. The first and second interpretations act on derivations in much the same way as Plotkin's call-by-value and call-by-name continuation-passing-style translations, respectively. We conclude that classical logic can be given a constructive semantics by laying down introduction rules for the classical logical constants. This semantics constitutes a proof interpretation of classical logic.
|
Page generated in 0.0658 seconds