scientific article; zbMATH DE number 3053259

No author found.

Publication date: 1948

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

Philosophy and foundations of mathematics

Related Items (94)

Dynamical system where proving chaos is equivalent to proving Fermat's conjecture ⋮ Practically solving some problems expressed in the first order theory of real closed field ⋮ Unnamed Item ⋮ Erratum to: ``Analyzing restricted fragments of the theory of linear arithmetic ⋮ Transformation of PGO into a calculable expression: problem-solving machines, III ⋮ Parametric toricity of steady state varieties of reaction networks ⋮ Leon Henkin the Reviewer ⋮ On maps which preserve semipositivity and quantifier elimination theory for real numbers ⋮ Fourth- and Higher-order Interface Tracking Via Mapping and Adjusting Regular Semianalytic sets Represented by Cubic Splines ⋮ Note on the computational complexity of $j$-radii of polytopes in $\mathbb R^ n$ ⋮ Cyclotomic torsion points in elliptic schemes ⋮ A generalization of the Tarski-Seidenberg theorem, and some nondefinability results ⋮ Size-based termination of higher-order rewriting ⋮ Positivstellensatz for semi-algebraic sets in real closed valued fields ⋮ Closure and connected component of a planar global semianalytic set defined by analytic functions definable in o-minimal structure ⋮ On the zeros of univariate E-polynomials ⋮ Faster real root decision algorithm for symmetric polynomials ⋮ Levelwise construction of a single cylindrical algebraic cell ⋮ Embedding the prime model of real exponentiation into o‐minimal exponential fields ⋮ On rereading van Heijenoort's selected essays ⋮ Is computer algebra ready for conjecturing and proving geometric inequalities in the classroom? ⋮ Quantifier elimination theory and maps which preserve semipositivity ⋮ An intertwined Cauchy-Schwarz-type inequality based on a Lagrange-type identity ⋮ Phenotype space and kinship assignment for the simpson index ⋮ A survey of some methods for real quantifier elimination, decision, and satisfiability and their applications ⋮ Superposition as a decision procedure for timed automata ⋮ A modal logic framework for reasoning about comparative distances and topology ⋮ On the decidability of Diophantine problems in combinatorial geometry ⋮ On the Bennett-Hoeffding inequality ⋮ A decidable theory involving addition of differentiable real functions ⋮ Examples of stability of tensor products in positive characteristic ⋮ A review and prospect of readable machine proofs for geometry theorems ⋮ Some Recursively Unsolvable Problems in Analysis ⋮ Complexity of computing interval matrix powers for special classes of matrices. ⋮ Necessary conditions for the generic global rigidity of frameworks on surfaces ⋮ Nonpresentability of the semigroup $\omega^\omega$ over $\mathbb H\mathbb F(\mathbb R)$ ⋮ Reducts of $p$-adically closed fields ⋮ Constraint Satisfaction Problems over Numeric Domains ⋮ PLQP \& Company: decidable logics for quantum algorithms ⋮ Undecidability of linear inequalities in graph homomorphism densities ⋮ A geometric model of an arbitrary differentially closed field of characteristic zero ⋮ Computational complexity of sentences over fields ⋮ Links with splitting number one ⋮ SOLVING DIFFERENCE EQUATIONS IN SEQUENCES: UNIVERSALITY AND UNDECIDABILITY ⋮ Independence in computable algebra ⋮ Computable Fields and Arithmetically Definable Ordered Fields ⋮ Metric estimates and membership complexity for Archimedean amoebae and tropical hypersurfaces ⋮ Analyzing restricted fragments of the theory of linear arithmetic ⋮ A decision method for $p$-adic integral zeros of diophantine equations ⋮ A search-based procedure for nonlinear real arithmetic ⋮ Abstractions for hybrid systems ⋮ On the extreme points of moments sets ⋮ Definable sets in ordered structures ⋮ Necessary conditions for the global rigidity of direction-length frameworks ⋮ Using machine learning to improve cylindrical algebraic decomposition ⋮ Models of complete theories ⋮ Some formal tools for analyzing quantum automata. ⋮ Supporting Global Numerical Optimization of Rational Functions by Generic Symbolic Convexity Tests ⋮ Toward the best constant factor for the Rademacher-Gaussian tail comparison ⋮ Continuum, name and paradox ⋮ Checking existence of solutions of partial differential equations in the fields of Laurent series ⋮ Algorithmic Procedures ⋮ The solubility of certain decision problems in arithmetic and algebra ⋮ Probability logic in the twentieth century ⋮ Quasitoric totally normally split manifolds ⋮ Efficiently and effectively recognizing toricity of steady state varieties ⋮ A Simple Quantifier-Free Formula of Positive Semidefinite Cyclic Ternary Quartic Forms ⋮ Direct Integral Decompositions and Multiplicities for Induced Representations of Nilpotent Lie Groups ⋮ Diversity, dependence and independence ⋮ Model Complete Theories with a Distinguished Substructure ⋮ A proof of A. Gabrielov's rank theorem ⋮ Algorithmic reduction of biological networks with multiple time scales ⋮ Virtual Substitution for SMT-Solving ⋮ Combined Decision Techniques for the Existential Theory of the Reals ⋮ Degrees of Computability ⋮ DECIDABLE ALGEBRAIC FIELDS ⋮ Some notions and problems of game theory ⋮ Nonexistence of a continuous right inverse for surjective linear partial differential operators on the Fréchet spaces $\gamma^{(\delta)}(\Omega)$ ⋮ The Computational Geometry of Comparing Shapes ⋮ Description of all functions definable by formulæ of the 2nd order intuitionistic propositional calculus on some linear Heyting algebras ⋮ Problem-solving machines for Euclidean geometry ⋮ Tilings with congruent tiles ⋮ On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines ⋮ Unifying threads in Alfred Tarski's work ⋮ Combining Equational Reasoning ⋮ Counting special points: Logic, diophantine geometry, and transcendence theory ⋮ Weak essentially undecidable theories of concatenation ⋮ Definable Sets in Ordered Structures. II ⋮ Classes of Predictably Computable Functions ⋮ Globally Linked Pairs of Vertices in Rigid Frameworks ⋮ Undecidable Rings ⋮ A portrait of Alfred Tarski ⋮ Unifying known lower bounds via geometric complexity theory ⋮ Improved inapproximability results for counting independent sets in the hard-core model

This page was built for publication: