共 10 条
- [1] Formally-Verified Decision Procedures for Univariate Polynomial Computation Based on Sturm’s and Tarski’s Theorems Journal of Automated Reasoning, 2015, 54 : 285 - 326
- [3] A Formally Verified Abstract Account of Godel's Incompleteness Theorems AUTOMATED DEDUCTION, CADE 27, 2019, 11716 : 442 - 461
- [5] Near-optimal analysis of Lasserre’s univariate measure-based bounds for multivariate polynomial optimization Mathematical Programming, 2021, 188 : 443 - 460
- [10] Two Decision Procedures for da Costa’s Cn\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$C_n$$\end{document} Logics Based on Restricted Nmatrix Semantics Studia Logica, 2022, 110 (3) : 601 - 642