Mathias Barra
From MaRDI portal
Person:3060188
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Bounded minimalisation and bounded counting in argument-bounded idc's Mathematical Structures in Computer Science | 2010-12-01 | Paper |
| The ordinal of Skolem + tetration is \({\tau}_0\) Programs, Proofs, Processes | 2010-07-29 | Paper |
| Skolem + tetration is well-ordered Mathematical Theory and Computational Practice | 2010-07-28 | Paper |
| Pure Iteration and Periodicity Logic and Theory of Algorithms | 2008-06-19 | Paper |
| A Characterisation of the Relations Definable in Presburger Arithmetic Lecture Notes in Computer Science | 2008-05-27 | Paper |
| New Computational Paradigms Lecture Notes in Computer Science | 2006-01-11 | Paper |
Research outcomes over time
This page was built for person: Mathias Barra
