mscroggs.co.uk
mscroggs.co.uk

subscribe

Blog

Logic bot, pt. 2

 2015-03-15 
A few months ago, I set @mathslogicbot 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!

Similar posts

Logical contradictions
Logic bot
Interesting tautologies
How OEISbot works

Comments

Comments in green were written by me. Comments in blue were not written by me.
 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>
To prove you are not a spam bot, please type "theorem" in the box below (case sensitive):

Archive

Show me a random blog post
 2020 

Jul 2020

Happy √3e3τ-87 Approximation Day!

May 2020

A surprising fact about quadrilaterals
Interesting tautologies

Mar 2020

Log-scaled axes

Feb 2020

PhD thesis, chapter ∞
PhD thesis, chapter 5
PhD thesis, chapter 4
PhD thesis, chapter 3
Inverting a matrix
PhD thesis, chapter 2

Jan 2020

PhD thesis, chapter 1
Gaussian elimination
Matrix multiplication
Christmas (2019) is over
 2019 
▼ show ▼
 2018 
▼ show ▼
 2017 
▼ show ▼
 2016 
▼ show ▼
 2015 
▼ show ▼
 2014 
▼ show ▼
 2013 
▼ show ▼
 2012 
▼ show ▼

Tags

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

Archive

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