scientific article; zbMATH DE number 3595145
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) Recursive functions and relations, subrecursive hierarchies (03D20) Applications of computability and recursion theory (03D80) Continuum hypothesis and Martin's axiom (03E50) Proof theory and constructive mathematics (03F99) Quantum logic (03G12) Connections of number theory and logic (11U99) Applications of logic to group theory (20A15)
- Q-spaces and the foundations of quantum mechanics
- Constructive high-dimensional sphere packings
- What does logic have to tell us about mathematical proofs?
- Dispersion mapping theorems
- On valued rings
- Undecidability and incompleteness in classical mechanics
- Additivity of vector Gleason measures
- First-order logic -- The unity of fuzziness and randomness
- A derived algorithm for evaluating -expressions over abstract sets
- A direct method for simulating partial recursive functions by Diophantine equations
- Gödel's incompleteness theorem
- Toward the limits of the Tennenbaum phenomenon
- An intensional Schrödinger logic
- Algorithmic complexity of recursive and inductive algorithms
- Non-standard finite fields over \(I\Delta_0+\Omega_1\)
- Three-variable statements of set-pairing
- Pell equations and exponentiation in fragments of arithmetic
- Geometry of the space of triangulations of a compact manifold
- Complexity assessments for decidable fragments of set theory. II: A taxonomy for `small' languages involving membership
- A Burgessian critique of nominalistic tendencies in contemporary mathematics and its historiography
- A discussion on particle number and quantum indistinguishability
- Diophantine representation of the decimal expansions of e and
- Dummett's case for intuitionism
- scientific article; zbMATH DE number 7449995 (Why is no real title available?)
- The Word Problem and Related Results for Graph Product Groups
- Small specifications for large finite data structures
- h-cobordism and s-cobordism theorems: transfer over semialgebraic and Nash categories, uniform bound and effectiveness
- Tangential Hilbert problem for perturbations of hyperelliptic Hamiltonian systems
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- Image of Soviet and Russian logic in the West. Latter Half of the XXth Century
- ``One equation to rule them all, revisited
- A formal framework for the study of the notion of undefined particle number in quantum mechanics
- Complexity assessments for decidable fragments of set theory. I: A taxonomy for the Boolean case
- Eager Equality for Rational Number Arithmetic
- Symmetric transrationals: the data type and the algorithmic degree of its equational theory
- Logical models of mathematical texts: the case of conventions for division by zero.
- Turing incomputable computation
- Expressiveness and the completeness of Hoare's logic
- A Suppes predicate for general relativity and set-theoretically generic spacetimes
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4160889)
