On normalization of proofs in set theory

Lars Hallnäs

Displaying similar documents to “On normalization of proofs in set theory”

A Kalmár-style completeness proof for the logics of the hierarchy $𝕀^{n} ℙ^{k}$

Víctor Fernández (2023)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

The logics of the family $𝕀^{n} ℙ^{k}$ := ${I^{n} P^{k}}_{(n, k) \in ω^{2}}$ are formally defined by means of finite matrices, as a simultaneous generalization of the weakly-intuitionistic logic $I^{1}$ and of the paraconsistent logic $P^{1}$ . It is proved that this family can be naturally ordered, and it is shown a sound and complete axiomatics for each logic of the form $I^{n} P^{k}$ . The involved completeness proof showed here is obtained by means of a generalization of the well-known Kalmár’s method, usually applied for many-valued logics.

Propositional extensions of $L_{ω} 1_{ω}$

Richard Gostanian, Karel Hrbacek

Similarity:

CONTENTS0. Preliminaries....................................................................... 71. Adding propositional connectives to $L_{ω} 1_{ω}$ ............... 82. The propositional part of $L_{ω} 1_{ω}$ (S)............................. 103. The operation S and the Boolean algebra $B_{S}$ ............... 114. General model-theoretic properties of $L_{ω} 1_{ω}$ (S)...... 175. Hanf number computations...................................................... 226. Negative results for $L_{ω} 1_{ω}$ (S)...........................................

Completeness properties of classical theories of finite type and the normal form theorem

Peter Päppinghaus

Similarity:

CONTENTSIntroduction........................................................................................................................................................................................................................50. Terminology and preliminaries......................................................................................................................................................................................121. The extent of cut elimination by...

A topological duality for the $F$ -chains associated with the logic $C_{ω}$

Verónica Quiroga, Víctor Fernández (2017)

Mathematica Bohemica

Similarity:

In this paper we present a topological duality for a certain subclass of the $F_{ω}$ -structures defined by M. M. Fidel, which conform to a non-standard semantics for the paraconsistent N. C. A. da Costa logic $C_{ω}$ . Actually, the duality introduced here is focused on $F_{ω}$ -structures whose supports are chains. For our purposes, we characterize every $F_{ω}$ -chain by means of a new structure that we will call (DCC) here. This characterization will allow us to prove the dual equivalence between the category...

Uncountable cardinals have the same monadic ∀₁¹ positive theory over large sets

Athanassios Tzouvaras (2004)

Fundamenta Mathematicae

Similarity:

We show that uncountable cardinals are indistinguishable by sentences of the monadic second-order language of order of the form (∀X)ϕ(X) and (∃X)ϕ(X), for ϕ positive in X and containing no set-quantifiers, when the set variables range over large (= cofinal) subsets of the cardinals. This strengthens the result of Doner-Mostowski-Tarski [3] that (κ,∈), (λ,∈) are elementarily equivalent when κ, λ are uncountable. It follows that we can consistently postulate that the structures $(2^{κ}, {[2^{κ}]}^{> κ}, <)$ , $(2^{λ}, {[2^{λ}]}^{> λ}, <)$ are...

Characterizing the powerset by a complete (Scott) sentence

Ioannis Souldatos (2013)

Fundamenta Mathematicae

Similarity:

This paper is part II of a study on cardinals that are characterizable by a Scott sentence, continuing previous work of the author. A cardinal κ is characterized by a Scott sentence $ϕ_{ℳ}$ if $ϕ_{ℳ}$ has a model of size κ, but no model of size κ⁺. The main question in this paper is the following: Are the characterizable cardinals closed under the powerset operation? We prove that if $ℵ_{β}$ is characterized by a Scott sentence, then $2^{ℵ_{β + β ₁}}$ is (homogeneously) characterized by a Scott sentence, for all 0 <...

The $ℒ_{n}^{m}$ -propositional calculus

Carlos Gallardo, Alicia Ziliani (2015)

Mathematica Bohemica

Similarity:

T. Almada and J. Vaz de Carvalho (2001) stated the problem to investigate if these Łukasiewicz algebras are algebras of some logic system. In this article an affirmative answer is given and the $ℒ_{n}^{m}$ -propositional calculus, denoted by $ℓ_{n}^{m}$ , is introduced in terms of the binary connectives $\to$ (implication), $↠$ (standard implication), $\land$ (conjunction), $\lor$ (disjunction) and the unary ones $f$ (negation) and $D_{i}$ , $1 \leq i \leq n - 1$ (generalized Moisil operators). It is proved that $ℓ_{n}^{m}$ belongs to the class of standard systems...

A generalization of a formalized theory of fields of sets on non-classical logics

Helena Rasiowa

Similarity:

Contents Introduction.................................................................................................................................................. 3 § 1. System $𝒮$ of a propositional calculus...................................................................... 4 § 2. System $𝒮 *$ ..................................................................................................................... 5 § 3. $𝒮 *$ -algebras.....................................................................................................................

The decidability of some $ℵ_{0}$ -categorical theories

James H. Schmerl (1976)

Colloquium Mathematicae

Similarity:

On sentences provable in impredicative extensions of theories

Zygmunt Ratajczyk

Similarity:

CONTENTS0. Introduction.......................................................................... 51. Preliminaries............................................................................... 72. Basic facts to be used in the sequel....................................... 113. Predicates OD(.,.) and CL(.,.).................................................... 174. Predicate Sels............................................................................. 185. Strong $\sum_{n}^{1}$ -collection...........................................................

On the $T$ -conditionality of $T$ -power based implications

Zuming Peng (2022)

Kybernetika

Similarity:

It is well known that, in forward inference in fuzzy logic, the generalized modus ponens is guaranteed by a functional inequality called the law of $T$ -conditionality. In this paper, the $T$ -conditionality for $T$ -power based implications is deeply studied and the concise necessary and sufficient conditions for a power based implication $I^{T}$ being $T$ -conditional are obtained. Moreover, the sufficient conditions under which a power based implication $I^{T}$ is $T^{*}$ -conditional are discussed, this discussions...

On ordinals accessible by infinitary languages

Saharon Shelah, Pauli Väisänen, Jouko Väänänen (2005)

Fundamenta Mathematicae

Similarity:

Let λ be an infinite cardinal number. The ordinal number δ(λ) is the least ordinal γ such that if ϕ is any sentence of $L_{λ ⁺ ω}$ , with a unary predicate D and a binary predicate ≺, and ϕ has a model ℳ with $⟨ D^{ℳ}, ≺^{ℳ} ⟩$ a well-ordering of type ≥ γ, then ϕ has a model ℳ ’ where $⟨ D^{ℳ^{'}}, ≺^{ℳ^{'}} ⟩$ is non-well-ordered. One of the interesting properties of this number is that the Hanf number of $L_{λ ⁺ ω}$ is exactly $ℶ_{δ (λ)}$ . It was proved in [BK71] that if ℵ₀ < λ < κ $a r e r e g u l a r c a r d i n a l n u m b e r s, t h e n t h e r e i s a f o r c i n g e x t e n s i o n, p r e s e r v i n g c o f i n a l i t i e s, s u c h t h a t i n t h e e x t e n s i o n$ 2λ = κ $a n d δ (λ) < λ ⁺ ⁺ . W e i m p r o v e t h i s r e s u l t b y p r o v i n g t h e f o l l o w i n g : S u p p o s e ℵ ₀ < λ < θ \leq κ a r e c a r d i n a l n u m b e r s s u c h t h a t$ ∙ $λ^{< λ} = λ$ ; ∙ cf(θ) ≥ λ⁺ and $μ^{λ} < θ$ whenever μ < θ; ∙ $κ^{λ} = κ$ . Then there...

The $S_{α}$ separation axioms

J. Guia (1986)

Matematički Vesnik

Similarity: