Tag: computer science

I would think that the formalism expressed as logic-circuit could evaluate itself.

---

Reflexivity – Part 1 of 3

Any attempt to disprove the formalism would be redressed via generality.

Properties on solid footing:

1. Identity – the logic gates are equal to themselves times one.
2. Generality – any alternative solution to the formalism than itself isn’t a solution to the formalism.
3. Algorithmic – any departure from the formalism would forsake both identity, because a departure from the formalism wouldn’t be equal to the formalism, and generality, because a departure from the formalism wouldn’t be a solution to the formalism.
4. Paradoxical – the formalism is both true and false.

Miscellania:

1. Regarding reflexivity – what if logic’s description of itself were incomplete?
2. Regarding truth – what if logic were both incomplete and inconsistent? However, the identity property is suggestive of the truth of the formalism, because it would be equal to itself. Additionally, generality proves that logic is inconsistent, even if logic were incomplete.

Update 6/12/2026

Regarding the algorithmic property, a boolean algebra circuit is an algorithm.

---

The five properties – Part 5 of 5

In light of careful consideration of my work, I’ve decided to update some of the properties:

1. Identity: plug-in – logic is logical. Reflexivity connotes that logic describes itself.
2. Reflexivity: I assert that the logic gates function because logic is true. This idea is not well-developed, but I think that the notion that logic gates work because the proof proves itself will be shown. Also, for these reasons, logic will describe itself.
3. Truth – that the proof proves itself connotes trinary logic is true.

---

The five properties – Part 4 of 5

My explanation for why the properties hold are:

Identity – Plug in – what is logical? Logic.

Reflexivity – if truth is complete, it is recursively enumerable ( to borrow tarskis phrase).

Generality – solutions such as “idiotic”, “inane”,.”non-sensical”, etc. are addressed.

Truth – the formalism equation is accurate.

Algirithmic the formalism in application is an algorithm, with the equation as the rules.

---

The five properties – Part 3 of 5

Truth – logic is true

Generality – logic is general (I’m guessing that logic has this property)

Algorithmic – logic is an algorithm (I’m guessing that logic has this property)

---

The five properties – Part 2 of 5

1. Identity – the only solution to logic is logic

2. Reflexivity – logic defines itself

---

The five properties – Part 1 of 5