algorithmic logic

{{Short description|Logic for mathematics}}

{{Original research|date=February 2016}}

Algorithmic logic is a calculus of programs that allows the expression of semantic properties of programs by appropriate logical formulas. It provides a framework that enables proving the formulas from the axioms of program constructs such as assignment, iteration and composition instructions and from the axioms of the data structures in question see {{harvtxt|Mirkowska|Salwicki|1987}}, {{harvtxt|Banachowski|Kreczmar|Mirkowska|Rasiowa|1977}}.

The following diagram helps to locate algorithmic logic among other logics.

\qquad \left [\begin{array}{l} \mathrm{Propositional\ logic}\\or \\ \mathrm{Sentential\ calculus} \end{array}\right ]\subset \left [\begin{array}{l} \mathrm{Predicate\ calculus} \\or \\ \mathrm{First\ order\ logic}\end{array}\right ] \subset \left [\begin{array}{l}\mathrm{Calculus\ of\ programs}\\or \\ \mbox{Algorithmic logic} \end{array}\right ]

The formalized language of algorithmic logic (and of algorithmic theories of various data structures) contains three types of well formed expressions: Terms - i.e. expressions denoting operations on elements of data structures,

formulas - i.e. expressions denoting the relations among elements of data structures, programs - i.e. algorithms - these expressions describe the computations.

For semantics of terms and formulas consult pages on first-order logic and Tarski's semantics. The meaning of a program K is the set of possible computations of the program.

Algorithmic logic is one of many logics of programs.

Another logic of programs is dynamic logic, see dynamic logic, {{harvtxt|Harel|Kozen|Tiuryn|2000}}.

Bibliography

  1. {{cite book|last1=Mirkowska|first1=Grażyna|title=Algorithmic Logic|url=http://lem12.uksw.edu.pl/images/3/35/Algorithmic_Logic.pdf|year=1987|publisher=PWN & D. Reidel Publ.|location=Warszawa & Boston|isbn=8301068590|pages=372|last2=Salwicki|first2= Andrzej}}]
  2. [Banachowski et al.] [http://lem12.uksw.edu.pl/images/4/42/Bcp211.pdf |{{ cite book | last1= Banachowski | first1= Lech | title= An introduction to Algorithmic Logic - Metamathematical Investigations of Theory of Programs | publisher= PWN | place = Warszawa | date = 1977 | series = Banach Center Publications | pages= 7–99 | last2= Kreczmar | first2= Antoni | last3= Mirkowska | first3= Grażyna | last4= Rasiowa | first4= Helena | last5= Salwicki | first5= Andrzej | volume = 2 }}]
  3. {{cite book|last1=Harel|first1=David|author1link = David Harel|last2=Kozen|first2=Dexter|author2link = Dexter Kozen|last3=Tiuryn|first3=Jerzy|title=Dynamic Logic|url=https://archive.org/details/dynamiclogicfoun00davi_0|url-access=registration| year=2000|publisher=MIT Press|location=Cambridge Massachusetts| pages=[https://archive.org/details/dynamiclogicfoun00davi_0/page/459 459]|isbn=978-0-262-08289-1 }}

Category:Algorithms

Category:Theoretical computer science

{{mathlogic-stub}}