The following pages link to (Q5792485):
Displaying 44 items.
- Classes of Predictably Computable Functions (Q3293402) (← links)
- SOLVING DIFFERENCE EQUATIONS IN SEQUENCES: UNIVERSALITY AND UNDECIDABILITY (Q3304645) (← links)
- Definable sets in ordered structures (Q3329447) (← links)
- Probability logic in the twentieth century (Q3356294) (← links)
- Leon Henkin the Reviewer (Q3454809) (← links)
- Phenotype space and kinship assignment for the simpson index (Q3515465) (← links)
- Supporting Global Numerical Optimization of Rational Functions by Generic Symbolic Convexity Tests (Q3589077) (← links)
- Combined Decision Techniques for the Existential Theory of the Reals (Q3637273) (← links)
- The Computational Geometry of Comparing Shapes (Q3644725) (← links)
- Description of all functions definable by formulæ of the 2nd order intuitionistic propositional calculus on some linear Heyting algebras (Q3647249) (← links)
- Combining Equational Reasoning (Q3655192) (← links)
- A generalization of the Tarski-Seidenberg theorem, and some nondefinability results (Q3752365) (← links)
- Direct Integral Decompositions and Multiplicities for Induced Representations of Nilpotent Lie Groups (Q3765986) (← links)
- On the decidability of Diophantine problems in combinatorial geometry (Q3784042) (← links)
- Definable Sets in Ordered Structures. II (Q3812218) (← links)
- Models of complete theories (Q3848967) (← links)
- The solubility of certain decision problems in arithmetic and algebra (Q3867971) (← links)
- Tilings with congruent tiles (Q3914000) (← links)
- Algorithmic Procedures (Q4018437) (← links)
- (Q4101953) (← links)
- Practically solving some problems expressed in the first order theory of real closed field (Q4256129) (← links)
- Fourth- and Higher-order Interface Tracking Via Mapping and Adjusting Regular Semianalytic sets Represented by Cubic Splines (Q4558231) (← links)
- Size-based termination of higher-order rewriting (Q4577817) (← links)
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines (Q4729768) (← links)
- DECIDABLE ALGEBRAIC FIELDS (Q4977216) (← links)
- Constraint Satisfaction Problems over Numeric Domains (Q4993596) (← links)
- On maps which preserve semipositivity and quantifier elimination theory for real numbers (Q5065095) (← links)
- A geometric model of an arbitrary differentially closed field of characteristic zero (Q5141765) (← links)
- Globally Linked Pairs of Vertices in Rigid Frameworks (Q5261884) (← links)
- Undecidability of linear inequalities in graph homomorphism densities (Q5390541) (← links)
- Toward the best constant factor for the Rademacher-Gaussian tail comparison (Q5429613) (← links)
- Transformation of PGO into a calculable expression: problem-solving machines, III (Q5561541) (← links)
- Some Recursively Unsolvable Problems in Analysis (Q5606585) (← links)
- Computable Fields and Arithmetically Definable Ordered Fields (Q5636867) (← links)
- A decision method for $p$-adic integral zeros of diophantine equations (Q5719471) (← links)
- Undecidable Rings (Q5804178) (← links)
- Some notions and problems of game theory (Q5814268) (← links)
- Diversity, dependence and independence (Q5918485) (← links)
- On the zeros of univariate E-polynomials (Q6070540) (← links)
- Levelwise construction of a single cylindrical algebraic cell (Q6149151) (← links)
- Embedding the prime model of real exponentiation into o‐minimal exponential fields (Q6152027) (← links)
- Is computer algebra ready for conjecturing and proving geometric inequalities in the classroom? (Q6157640) (← links)
- An intertwined Cauchy-Schwarz-type inequality based on a Lagrange-type identity (Q6180061) (← links)
- Beyond the Existential Theory of the Reals (Q6489317) (← links)
