Uploaded April 2019 | Updated November 2026, 3 hours ago
A quick demo of Gottlob, the new programming language I've been developing. It is based on the gloriously idiosyncratic notation developed in Gottlob Frege's Begriffsschrift. The only logical operation is implication, which also doubles as a conditional. Universal quantifiers serve as for loops. In this example I build an equivalent to the following code:
for a in [1..2]
for b in [1..2]
var c = (a==1) → ((b==1) → false))
print(c)
In more conventional terms, c = (a==1) || (b==1). (Remember, implication returns true if the test fails! And in this notation, the test comes *after* the consequent.) As is to be expected, this results in the following truth table. However, instead of true/false it is given in the terms used in Frege's writing.
denied
affirmed
affirmed
affirmed
A quick demo of Gottlob, the new programming language I've been developing. It is based on the gloriously idiosyncratic notation developed in Gottlob Frege's Begriffsschrift. The only logical operation is implication, which also doubles as a conditional. Universal quantifiers serve as for loops. In this example I build an equivalent to the following code:
for a in [1..2]
for b in [1..2]
var c = (a==1) → ((b==1) → false))
print(c)
In more conventional terms, c = (a==1) || (b==1). (Remember, implication returns true if the test fails! And in this notation, the test comes *after* the consequent.) As is to be expected, this results in the following truth table. However, instead of true/false it is given in the terms used in Frege's writing.
denied
affirmed
affirmed
affirmed










