mscroggs.co.uk
mscroggs.co.uk

subscribe

Blog

Logic bot, pt. 2

 2015-03-15 
A few months ago, I set @mathslogicbot (and @logicbot@mathstodon.xyz) going on the long task of tweeting all the tautologies (containing 140 characters or less) in propositional calculus with the symbols \(\neg\) (not), \(\rightarrow\) (implies), \(\leftrightarrow\) (if and only if), \(\wedge\) (and) and \(\vee\) (or). My first post on logic bot contains a full explanation of propositional calculus, formulae and tautologies.

An alternative method

Since writing the original post, I have written an alternative script to generate all the tautologies. In this new method, I run through all possible strings of length 1 made with character in the logical language, then strings of length 2, 3 and so on. The script then checks if they are valid formulae and, if so, if they are tautologies.
In the new script, only formulae where the first appearances of variables are in alphabetical order are considered. This means that duplicate tautologies are removed. For example, \((b\rightarrow(b\wedge a))\) will now be counted as it is the same as \((a\rightarrow(a\wedge b))\).
You can view or download this alternative code on github. All the terms of the sequence that I have calculated so far can be viewed here and the tautologies for these terms are here.

Sequence

One advantage of this method is that it generates the tautologies sorted by the number of symbols they contain, meaning we can generate the sequence whose \(n\)th term is the number of tautologies of length \(n\).
The first ten terms of this sequence are
$$0, 0, 0, 0, 2, 2, 12, 6, 57, 88$$
as there are no tautologies of length less than 5; and, for example two tautologies of length 6 (\((\neg a\vee a)\) and \((a\vee \neg a)\)).
This sequence is listed as A256120 on OEIS.

Properties

There are a few properties of this sequence that can easily be shown. Throughout this section I will use \(a_n\) to represent the \(n\)th term of the sequence.
Firstly, \(a_{n+2}\geq a_n\). This can be explained as follows: let \(A\) be a tautology of length \(n\). \(\neg\neg A\) will be of length \(n+2\) and is logically equivalent to \(A\).
Another property is \(a_{n+4}\geq 2a_n\): given a tautology \(A\) of length \(n\), both \((a\vee A)\) and \((A\vee a)\) will be tautologies of length \(n+4\). Similar properties could be shown for \(\rightarrow\), \(\leftrightarrow\) and \(\wedge\).
Given properties like this, one might predict that the sequence will be increasing (\(a_{n+1}\geq a_n\)). However this is not true as \(a_7\) is 12 and \(a_8\) is only 6. It would be interesting to know at how many points in the sequence there is a term that is less than the previous one. Given the properties above it is reasonable to conjecture that this is the only one.
Edit: The sequence has been published on OEIS!
×2                        
(Click on one of these icons to react to this blog post)

You might also enjoy...

Comments

Comments in green were written by me. Comments in blue were not written by me.
Great project! Would be interesting to have a version of this for the sheffer stroke.
om
                 Reply
 Add a Comment 


I will only use your email address to reply to your comment (if a reply is needed).

Allowed HTML tags: <br> <a> <small> <b> <i> <s> <sup> <sub> <u> <spoiler> <ul> <ol> <li> <logo>
To prove you are not a spam bot, please type "q" then "u" then "o" then "t" then "i" then "e" then "n" then "t" in the box below (case sensitive):

Archive

Show me a random blog post
 2024 

Feb 2024

Zines, pt. 2

Jan 2024

Christmas (2023) is over
 2023 
▼ show ▼
 2022 
▼ show ▼
 2021 
▼ show ▼
 2020 
▼ show ▼
 2019 
▼ show ▼
 2018 
▼ show ▼
 2017 
▼ show ▼
 2016 
▼ show ▼
 2015 
▼ show ▼
 2014 
▼ show ▼
 2013 
▼ show ▼
 2012 
▼ show ▼

Tags

stickers pascal's triangle turtles numerical analysis final fantasy bodmas polynomials ucl data visualisation rugby error bars sorting youtube edinburgh matrix of cofactors simultaneous equations chalkdust magazine tennis gather town graph theory map projections recursion sound platonic solids oeis preconditioning chess crochet countdown rhombicuboctahedron nine men's morris crossnumber errors guest posts wool sobolev spaces dinosaurs pi weak imposition geogebra manchester php inline code estimation martin gardner talking maths in public big internet math-off cambridge graphs football data london royal institution gerry anderson finite group anscombe's quartet flexagons 24 hour maths pythagoras christmas card interpolation curvature bempp folding tube maps approximation mathsjam folding paper finite element method dataset news dates wave scattering electromagnetic field boundary element methods national lottery correlation latex royal baby harriss spiral world cup plastic ratio squares quadrilaterals machine learning video games programming advent calendar christmas speed matrix multiplication books logo game show probability radio 4 geometry european cup matrices dragon curves people maths matrix of minors frobel mathsteroids chebyshev logs matt parker london underground statistics mean standard deviation hats accuracy determinants manchester science festival logic realhats hexapawn golden ratio probability propositional calculus palindromes convergence weather station noughts and crosses hyperbolic surfaces pizza cutting zines a gamut of games cross stitch python the aperiodical hannah fry game of life golden spiral pi approximation day stirling numbers misleading statistics arithmetic trigonometry javascript games gaussian elimination draughts light braiding pac-man mathslogicbot captain scarlet raspberry pi inverse matrices newcastle bubble bobble binary exponential growth coins ternary triangles asteroids fence posts datasaurus dozen craft go fonts puzzles runge's phenomenon phd reddit tmip signorini conditions fractals numbers reuleaux polygons sport menace databet computational complexity live stream

Archive

Show me a random blog post
▼ show ▼
© Matthew Scroggs 2012–2024