---
title: "Discussion on \"Preparing Logic for Machines: PNF and Skolemization\" | Hashnode"
description: "Discussion on \"Preparing Logic for Machines: PNF and Skolemization\". In the world of automated theorem proving, raw logical formulas are often too messy for algorithms to handle directly. Before a computer can prove a theorem, we usually need to standardize the format. Today, we look at two critical transformation ste..."
url: "https://hashnode.com/posts/preparing-logic-for-machines-pnf-and-skolemization/695cac02af93789090f14131"
---

[Feed](https://hashnode.com/feed) /

Discussion

# [Preparing Logic for Machines: PNF and Skolemization](https://first-order-logic.hashnode.dev/preparing-logic-for-machines-pnf-and-skolemization?utm_source=hashnode&utm_medium=feed)

In the world of automated theorem proving, raw logical formulas are often too messy for algorithms to handle directly. Before a computer can prove a theorem, we usually need to standardize the format. Today, we look at two critical transformation ste...

Jan 6 · 2 min read · first-order-logic.hashnode.dev  
Read the article

-   [#cs](https://hashnode.com/tag/cs)
-   [#logic](https://hashnode.com/tag/logic)
-   [#prolog](https://hashnode.com/tag/prolog)

## Written by

[Scott D. Weeden](https://hashnode.com/@scott-weeden)

@scott-weeden

  
[View profile](https://hashnode.com/@scott-weeden)

Iterating through life and code, seeking optimal solutions

## Responses

Markdown supported · ⌘↵ to post

No responses yet.
