Zeroth-order logic is first-order logic without quantifiers. A finitely axiomatizable zeroth-order logic is isomorphic to a propositional logic. Zeroth-order logic with axiom schema is a more expressive system than propositional logic. An example is given by the system Primitive recursive arithmetic, or PRA.
| Property | Value |
|---|
| dbpprop:abstract
|
- Zeroth-order logic is first-order logic without quantifiers. A finitely axiomatizable zeroth-order logic is isomorphic to a propositional logic. Zeroth-order logic with axiom schema is a more expressive system than propositional logic. An example is given by the system Primitive recursive arithmetic, or PRA.
- 零阶逻辑是在与布尔函数、一元谓词逻辑、命题演算或句子逻辑有关主题的从业人员中流行的术语。使用这个术语的好处是它确立了更高的抽象层次，在其中上述这些主题之间的很无关紧要的区别可以在这个中肯的同构下被包容。 向着最初的方向，表 1 列出了具体类型 X × Y → B 和抽象类型 B × B → B 的十六个函数在零阶逻辑的不同语言中的等价表达。
|
| rdf:type
| |
| rdfs:comment
|
- Zeroth-order logic is first-order logic without quantifiers. A finitely axiomatizable zeroth-order logic is isomorphic to a propositional logic. Zeroth-order logic with axiom schema is a more expressive system than propositional logic. An example is given by the system Primitive recursive arithmetic, or PRA.
- 零阶逻辑是在与布尔函数、一元谓词逻辑、命题演算或句子逻辑有关主题的从业人员中流行的术语。使用这个术语的好处是它确立了更高的抽象层次，在其中上述这些主题之间的很无关紧要的区别可以在这个中肯的同构下被包容。 向着最初的方向，表 1 列出了具体类型 X × Y → B 和抽象类型 B × B → B 的十六个函数在零阶逻辑的不同语言中的等价表达。
|
| rdfs:label
| |
| owl:sameAs
| |
| skos:subject
| |
| foaf:page
| |
| is owl:sameAs
of | |
![[RDF Data]](/statics/sw-cube.png)
