| Partial arithmetical data types of rational numbers and their equational specification | 0 | 0.34 | 2022 |
| Datatype Defining Rewrite Systems For Naturals And Integers | 0 | 0.34 | 2021 |
| Non-commutative propositional logic with short-circuit evaluation. | 0 | 0.34 | 2021 |
| Most General Algebraic Specifications For An Abstract Datatype Of Rational Numbers | 0 | 0.34 | 2020 |
| Arithmetical datatypes with true fractions | 0 | 0.34 | 2020 |
| Sumterms, Summands, Sumtuples, And Sums And The Meta-Arithmetic Of Summation | 0 | 0.34 | 2020 |
| Instruction Sequence Faults With Formal Change Justification | 0 | 0.34 | 2020 |
| Quantitative Expressiveness Of Instruction Sequence Classes For Computation On Single Bit Registers | 0 | 0.34 | 2019 |
| A Short Introduction To Program Algebra With Instructions For Boolean Registers | 1 | 0.38 | 2018 |
| Propositional logic with short-circuit evaluation: a non-commutative and a commutative variant. | 0 | 0.34 | 2018 |
| Instruction Sequences Expressing Multiplication Algorithms | 0 | 0.34 | 2018 |
| Probability Functions in the Context of Signed Involutive Meadows (Extended Abstract). | 0 | 0.34 | 2016 |
| Subvarieties Of The Variety Of Meadows | 0 | 0.34 | 2015 |
| Division by Zero in Common Meadows. | 2 | 0.47 | 2015 |
| Promises, Impositions, and other Directionals. | 0 | 0.34 | 2014 |
| Bitcoin and Beyond: Exclusively Informational Monies | 5 | 0.48 | 2013 |
| Long multiplication by instruction sequences with backward jump instructions. | 3 | 0.50 | 2013 |
| Cancellation Meadows: A Generic Basis Theorem and Some Applications. | 4 | 0.63 | 2013 |
| Questions related to Bitcoin and other Informational Money | 5 | 0.54 | 2013 |
| Instruction Sequence Based Non-Uniform Complexity Classes | 8 | 0.86 | 2013 |
| Instruction sequence expressions for the secure hash algorithm SHA-256. | 3 | 0.51 | 2013 |
| Informaticology: combining Computer Science, Data Science, and Fiction Science | 4 | 0.43 | 2012 |
| Process algebra with conditionals in the presence of epsilon | 2 | 0.40 | 2012 |
| Decision Taking versus Action Determination | 2 | 0.38 | 2012 |
| About Instruction Sequence Testing | 2 | 0.37 | 2012 |
| Proposition algebra | 1 | 0.41 | 2011 |
| Informatics Perspectives on Decision Taking | 7 | 0.58 | 2011 |
| A calculus for four-valued sequential logic | 0 | 0.34 | 2011 |
| Stratified Outsourcing Theory | 2 | 0.38 | 2011 |
| Outsourcing Competence | 0 | 0.34 | 2011 |
| Informal Control code logic | 3 | 0.43 | 2010 |
| Steering Fragments of Instruction Sequences | 3 | 0.49 | 2010 |
| Formaleuros, formalcoins and virtual monies | 3 | 0.43 | 2010 |
| Instruction sequence notations with probabilistic instructions | 4 | 0.50 | 2009 |
| Meadow Enriched ACP Process Algebras | 3 | 0.36 | 2009 |
| Straight-line Instruction Sequence Completeness for Total Calculation on Cancellation Meadows | 4 | 0.53 | 2009 |
| Autosolvability of halting problem instances for instruction sequences | 7 | 0.51 | 2009 |
| Square root meadows | 2 | 0.53 | 2009 |
| Local and Global Trust Based on the Concept of Promises | 5 | 0.75 | 2009 |
| Mechanistic Behavior of Single-Pass Instruction Sequences | 2 | 0.46 | 2008 |
| Towards a formalization of budgets | 13 | 0.50 | 2008 |
| A static theory of promises | 14 | 0.96 | 2008 |
| Proposition Algebra with Projective Limits | 3 | 0.45 | 2008 |
| Fields, meadows and abstract data types | 4 | 0.87 | 2008 |
| An Instruction Sequence Semigroup with Repeaters | 1 | 0.41 | 2008 |
| Differential Meadows | 0 | 0.34 | 2008 |
| Maurer Computers with Single-Thread Control | 10 | 0.74 | 2007 |
| Interface groups and financial transfer architectures | 21 | 0.73 | 2007 |
| Instruction Sequences with Dynamically Instantiated Instructions | 15 | 0.58 | 2007 |
| About "trivial" software patents: The IsNot case | 4 | 0.52 | 2007 |
