About: Skolem normal form

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Skolem normal form Goto Sponge NotDistinct Permalink

An Entity of Type : owl:Thing, within Data Space : el.dbpedia.org associated with source document(s)

In mathematical logic, a formula of first-order logic is in Skolem normal form if it is in prenex normal form with only universal first-order quantifiers. Every first-order formula may be converted into Skolem normal form while not changing its satisfiability via a process called Skolemization (sometimes spelled Skolemnization). The resulting formula is not necessarily equivalent to the original one, but is equisatisfiable with it: it is satisfiable if and only if the original one is satisfiable.

Attributes	Values
rdfs:label	Skolem normal form (en)
rdfs:comment	In mathematical logic, a formula of first-order logic is in Skolem normal form if it is in prenex normal form with only universal first-order quantifiers. Every first-order formula may be converted into Skolem normal form while not changing its satisfiability via a process called Skolemization (sometimes spelled Skolemnization). The resulting formula is not necessarily equivalent to the original one, but is equisatisfiable with it: it is satisfiable if and only if the original one is satisfiable. (en)
sameAs	Skolem normal form
dbp:wikiPageUsesTemplate	dbt:Citation dbt:MathWorld dbt:Short_description dbt:Springer
Subject	Model theory Normal forms (logic)
prov:wasDerivedFrom	http://en.wikipedia.org/wiki/Skolem_normal_form?oldid=1070544126&ns=0
Wikipage page ID	421074 (xsd:integer)
page length (characters) of wiki page	11186 (xsd:nonNegativeInteger)
Wikipage revision ID	1070544126 (xsd:integer)
has abstract	In mathematical logic, a formula of first-order logic is in Skolem normal form if it is in prenex normal form with only universal first-order quantifiers. Every first-order formula may be converted into Skolem normal form while not changing its satisfiability via a process called Skolemization (sometimes spelled Skolemnization). The resulting formula is not necessarily equivalent to the original one, but is equisatisfiable with it: it is satisfiable if and only if the original one is satisfiable. Reduction to Skolem normal form is a method for removing existential quantifiers from formal logic statements, often performed as the first step in an automated theorem prover. (en)
foaf:isPrimaryTopicOf	http://en.wikipedia.org/wiki/Skolem_normal_form
is Wikipage redirect of	Skolem function Skolemization Skolem Standard Form Skolem constant Skolem hull Skolem prenex form Skolem standard form Skolem term Skolem theory Skolemisation Skolemize Skolemized Skolemized Form Skolemized form Skolemnization
is Link from a Wikipage to another Wikipage of	Normal form Null (SQL) Branching quantifier Canonical form Glossary of set theory Method of analytic tableaux Occurs check Curry's paradox Hull List of mathematical logic topics Conjunctive normal form Herbrand structure Herbrandization Equisatisfiability First-order logic Game semantics Independence-friendly logic Index of philosophy articles (R–Z) Model theory Large countable ordinal Löwenheim–Skolem theorem

Faceted Search & Find service v1.17_git151 as of Feb 20 2025

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Nov 11 2024, on Linux (x86_64-ubuntu_focal-linux-gnu), Single-Server Edition (72 GB total memory, 1 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software