Displaying similar documents to “A Kalmár-style completeness proof for the logics of the hierarchy 𝕀 n k

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)...........................................

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...

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 (implication), (standard implication), (conjunction), (disjunction) and the unary ones f (negation) and D i , 1 i n - 1 (generalized Moisil operators). It is proved that n m belongs to the class of standard systems...

On normalization of proofs in set theory

Lars Hallnäs

Similarity:

CONTENTSIntroduction..............................................................................................................................................5I. Naive set theory.....................................................................................................................................61. The formal system................................................................................................................................62. Inversion and reduction...

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.....................................................................................................................

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...

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...

𝐋 -embedding, Amalgamation and 𝐋 -elementary equivalence

Daniele Mundici (1982)

Atti della Accademia Nazionale dei Lincei. Classe di Scienze Fisiche, Matematiche e Naturali. Rendiconti Lincei. Matematica e Applicazioni

Similarity:

Ogni logica L genera canonicamente la L -equivalenza L e la L -immersione 𝐿 proprio come la logica del primo ordine genera l’equivalenza elementare e l’immersione elementare . Astraendo da L , è interessante studiare in sè relazioni d’equivalenza e di immersione generali tra strutture. Mostriamo che esiste una corrispondenza biunivoca tra relazioni d’equivalenza con la proprietà di Robinson e relazioni d’immersione con la proprietà di Amalgamazione Forte ( A P + ). Caratterizziamo algebricamente...

H calculus and dilatations

Andreas M. Fröhlich, Lutz Weis (2006)

Bulletin de la Société Mathématique de France

Similarity:

We characterise the boundedness of the H calculus of a sectorial operator in terms of dilation theorems. We show e. g. that if - A generates a bounded analytic C 0 semigroup ( T t ) on a UMD space, then the H calculus of A is bounded if and only if ( T t ) has a dilation to a bounded group on L 2 ( [ 0 , 1 ] , X ) . This generalises a Hilbert space result of C.LeMerdy. If X is an L p space we can choose another L p space in place of L 2 ( [ 0 , 1 ] , X ) .

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 < λ < θ κ 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...

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 n 1 -collection...........................................................

C * -points vs P -points and P -points

Jorge Martinez, Warren Wm. McGovern (2022)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

In a Tychonoff space X , the point p X is called a C * -point if every real-valued continuous function on C { p } can be extended continuously to p . Every point in an extremally disconnected space is a C * -point. A classic example is the space 𝐖 * = ω 1 + 1 consisting of the countable ordinals together with ω 1 . The point ω 1 is known to be a C * -point as well as a P -point. We supply a characterization of C * -points in totally ordered spaces. The remainder of our time is aimed at studying when a point in a product space...

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 <...

A localization property for B p q s and F p q s spaces

Hans Triebel (1994)

Studia Mathematica

Similarity:

Let f j = k a k f ( 2 j + 1 x - 2 k ) , where the sum is taken over the lattice of all points k in n having integer-valued components, j∈ℕ and a k . Let A p q s be either B p q s or F p q s (s ∈ ℝ, 0 < p < ∞, 0 < q ≤ ∞) on n . The aim of the paper is to clarify under what conditions f j | A p q s is equivalent to 2 j ( s - n / p ) ( k | a k | p ) 1 / p f | A p q s .