Reprint

# Mathematical Logic and Its Applications 2020

Edited by

July 2021

196 pages

- ISBN978-3-0365-0778-1 (Hardback)
- ISBN978-3-0365-0779-8 (PDF)

This book is a reprint of the Special Issue Mathematical Logic and Its Applications 2020 that was published in

Computer Science & Mathematics

Engineering

Physical Sciences

Public Health & Healthcare

Summary

The issue "Mathematical Logic and Its Applications 2020" contains articles related to the following three directions:

- Descriptive Set Theory (3 articles). Solutions for long-standing problems, including those of A. Tarski and H. Friedman, are presented.
- Exact combinatorial optimization algorithms, in which the complexity relative to the source data is characterized by a low, or even first degree, polynomial (1 article).

III. Applications of mathematical logic and the theory of algorithms (2 articles). The first article deals with the Jacobian and M. Kontsevich’s conjectures, and algorithmic undecidability; for these purposes, non-standard analysis is used. The second article provides a quantitative description of the balance and adaptive resource of a human.

Submissions are invited for the next issue "Mathematical Logic and Its Applications 2021"Format

- Hardback

License

© by the authors

Keywords

definability; nonconstructible reals; projective hierarchy; generic models; almost disjoint forcing; Harvey Friedman’s problem; definability; nonconstructible reals; projective hierarchy; generic models; almost-disjoint forcing; universal algebraic geometry; affine algebraic geometry; elementary equivalence; isotypic algebras; first order rigidity; Ind-group; affine spaces; automorphisms; free associative algebras; Weyl algebra automorphisms; polynomial symplectomorphisms; deformation quantization; infinite prime number; semi-inner automorphism; embeddability of varieties; undecidability; noncommutative Gröbner-Shirshov basis; finitely presented algebraic systems; algorithmic unsolvability; turing machine; discrete optimization; exact algorithm; additively exact algorithm; graph transformation; graph of degree 2; chain-cycle graph; operation cost; minimization of total cost; definability of definable; tarski problem; type theoretic hierarchy; generic models; almost disjoint forcing; adaptive resource; resilience; resistance; tipping point; theory of catastrophes