Name
Abstract | ||
|---|---|---|
We introduce algorithmic logic - an algebraic approach according to [25]. It is done in three stages: propositional calculus, quantifier calculus with equality, and finally proper algorithmic logic. For each stage appropriate signature and theory are defined. Propositional calculus and quantifier calculus with equality are explored according to [24]. A language is introduced with language signature including free variables, substitution, and equality. Algorithmic logic requires a bialgebra structure which is an extension of language signature and program algebra. While-if algebra of generator set and algebraic signature is bialgebra with appropriate properties and is used as basic type of algebraic logic. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.2478/forma-2014-0025 | FORMALIZED MATHEMATICS |
Keywords | Field | DocType |
propsitional calcus, quantifier calcus, algorithmic logic | Term algebra,Signature (logic),Discrete mathematics,Algebra,Zeroth-order logic,Algorithmic logic,Classical logic,Many-valued logic,Abstract algebraic logic,Well-formed formula,Mathematics | Journal |
Volume | Issue | ISSN |
22 | 3 | 1898-9934 |
Citations | PageRank | References |
1 | 0.43 | 1 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Grzegorz Bancerek | 1 | 96 | 19.74 |