An algebraic treatment of quantifier-free systems of arithmetic

被引：3

作者：

Montagna, F ^{[1
]}

机构：

[1] UNIV SIENA,DIPARTIMENTO MATEMAT,I-53100 SIENA,ITALY

来源：

ARCHIVE FOR MATHEMATICAL LOGIC | 1996年 / 35卷 / 04期

关键词：

D O I：

10.1007/s001530050042

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

By algebraic means, we give an equational axiomatization of the equational fragments of various systems of arithmetic. We also introduce a faithful semantics according to which, for every reasonable system T for arithmetic, there is a model where exactly the theorems of T are true.

引用

页码：209 / 224

页数：16

共 50 条

[31] Quantifier-free axioms for constructive affine plane geometry
Suppes, P
SYNTHESE, 2000, 125 (1-2) : 263 - 281
[32] A tableau calculus for quantifier-free set theoretic formulae
Beckert, B
Hartmer, U
AUTOMATED REASONING WITH ANALYTIC TABLEAUX AND RELATED METHODS, 1998, 1397 : 93 - 107
[33] Compositional truth with propositional tautologies and quantifier-free correctness
Bartosz Wcisło
Archive for Mathematical Logic, 2024, 63 : 239 - 257
[34] Quantifier-Free Equational Logic and Prime Implicate Generation
Echenim, Mnacho
Peltier, Nicolas
Tourret, Sophie
AUTOMATED DEDUCTION - CADE-25, 2015, 9195 : 311 - 325
[35] Quantifier-Free Axioms For Constructive Affine Plane Geometry
Patrick Suppes
Synthese, 2000, 125 : 263 - 281
[36] Rewriting-based Quantifier-free Interpolation for a Theory of Arrays
Bruttomesso, Roberto
Ghilardi, Silvio
Ranise, Silvio
22ND INTERNATIONAL CONFERENCE ON REWRITING TECHNIQUES AND APPLICATIONS (RTA'11), 2011, 10 : 171 - 186
[37] A quantifier-free first-order knowledge logic of authentication
Kurkowski, Miroslaw
Srebrny, Marian
FUNDAMENTA INFORMATICAE, 2006, 72 (1-3) : 263 - 282
[38] Betti numbers of semialgebraic sets defined by quantifier-free formulae
Gabrielov, A
Vorobjov, N
DISCRETE & COMPUTATIONAL GEOMETRY, 2005, 33 (03) : 395 - 401
[39] Betti Numbers of Semialgebraic Sets Defined by Quantifier-Free Formulae
Andrei Gabrielov
Nicolai Vorobjov
Discrete & Computational Geometry, 2005, 33 : 395 - 401
[40] Coherence and Computational Complexity of Quantifier-free Dependence Logic Formulas
Jarmo Kontinen
Studia Logica, 2013, 101 : 267 - 291

← 1 2 3 4 5 →