scientific article; zbMATH DE number 3595145

zbMath0383.03002MaRDI QIDQ4160889

Yuri I. Manin

Publication date: 1977

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Applications of logic to group theory (20A15) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Classical first-order logic (03B10) Continuum hypothesis and Martin's axiom (03E50) Quantum logic (03G12) Recursive functions and relations, subrecursive hierarchies (03D20) Applications of computability and recursion theory (03D80) Proof theory and constructive mathematics (03F99) Connections of number theory and logic (11U99)

Related Items (37)

A direct method for simulating partial recursive functions by Diophantine equations ⋮ Tangential Hilbert problem for perturbations of hyperelliptic Hamiltonian systems ⋮ Gödel's incompleteness theorem ⋮ Three-variable statements of set-pairing ⋮ Image of Soviet and Russian logic in the West. Latter Half of the XXth Century ⋮ Constructive high-dimensional sphere packings ⋮ A discussion on particle number and quantum indistinguishability ⋮ The Word Problem and Related Results for Graph Product Groups ⋮ A Burgessian critique of nominalistic tendencies in contemporary mathematics and its historiography ⋮ Toward the limits of the Tennenbaum phenomenon ⋮ Pell equations and exponentiation in fragments of arithmetic ⋮ An intensional Schrödinger logic ⋮ Geometry of the space of triangulations of a compact manifold ⋮ What does logic have to tell us about mathematical proofs? ⋮ \(h\)-cobordism and \(s\)-cobordism theorems: transfer over semialgebraic and Nash categories, uniform bound and effectiveness ⋮ Unnamed Item ⋮ Eager Equality for Rational Number Arithmetic ⋮ Symmetric transrationals: the data type and the algorithmic degree of its equational theory ⋮ Dispersion mapping theorems ⋮ Unnamed Item ⋮ A Suppes predicate for general relativity and set-theoretically generic spacetimes ⋮ On valued rings ⋮ Complexity assessments for decidable fragments of set theory. II: A taxonomy for `small' languages involving membership ⋮ Undecidability and incompleteness in classical mechanics ⋮ Algorithmic complexity of recursive and inductive algorithms ⋮ Additivity of vector Gleason measures ⋮ Complexity Assessments for Decidable Fragments of Set Theory. I: A Taxonomy for the Boolean Case* ⋮ A formal framework for the study of the notion of undefined particle number in quantum mechanics ⋮ Dummett's case for intuitionism ⋮ Unnamed Item ⋮ Q-spaces and the foundations of quantum mechanics ⋮ Non-standard finite fields over \(I\Delta_0+\Omega_1\) ⋮ On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines ⋮ Small specifications for large finite data structures ⋮ First-order logic -- The unity of fuzziness and randomness ⋮ Expressiveness and the completeness of Hoare's logic ⋮ A derived algorithm for evaluating \(\varepsilon\)-expressions over abstract sets

This page was built for publication: