Sciact
  • EN
  • RU

Approximating formulae Full article

Journal Сибирские электронные математические известия (Siberian Electronic Mathematical Reports)
, E-ISSN: 1813-3304
Output data Year: 2024, Volume: 21, Number: 1, Pages: 463-480 Pages count : 18 DOI: 10.33048/semi.2024.21.033
Tags approximating formula, approximation of theory, pseudonite formula, spectrum of sentence
Authors Sudoplatov S.V. 1,2
Affiliations
1 Sobolev Institute of Mathematics, Academician Koptyug avenue, 4, 630090, Novosibirsk, Russ
2 Novosibirsk State Technical University, K. Marx avenue, 20, 630073, Novosibirsk, Russ

Funding (1)

1 Russian Science Foundation 24-21-00096

Abstract: The notion of a approximating formula is introduced. Links of approximating formulae and their spectra for pseudoniteness are studied. Semilattices, lattices, and Boolean algebras related to approximating formulae are found. Rank values of approximating formulae are studied. Relations between approximating formulae and positive, negative, ∀-formulae, ∃-formulae, ∃∀formulae, ∀∃-formulae are considered. Families of consistent formulae are considered and their approximability is characterized. The notion of totally approximating sentence is introduced and families of these sentences are characterized in terms of cardinalities of models and cardinalities of signatures.
Cite: Sudoplatov S.V.
Approximating formulae
Сибирские электронные математические известия (Siberian Electronic Mathematical Reports). 2024. V.21. N1. P.463-480. DOI: 10.33048/semi.2024.21.033 WOS Scopus РИНЦ
Dates:
Submitted: Feb 7, 2024
Published print: Jun 23, 2024
Published online: Jun 23, 2024
Identifiers:
Web of science: WOS:001283159700010
Scopus: 2-s2.0-85204492049
Elibrary: 75133062
Citing:
DB Citing
Web of science 1
Scopus 1
Elibrary 2
Altmetrics: