Difference between revisions of "Book/Algebraic Models for Accounting Systems"
Line 21: | Line 21: | ||
=Excerpts= | =Excerpts= | ||
The | The book presents and develops a proof-based, algebraic ap- proach to the study of accounting systems. The analysis provides a description of single firms in terms of abstract algebraic objects such as automata. It concentrates on the process of producing infor- mation from data provided by the environment through the double- entry system. This process, although considered by many to be the core of accounting, has often been ignored in accounting re- search. | ||
=Decision problems for Accounting Systems= | =Decision problems for Accounting Systems= | ||
#Decide whether a given transaction is allowable. | #Decide whether a given transaction is allowable. |
Revision as of 01:56, 30 June 2022
Rambaud, Salvador Cruz; Pérez, José García; Nehmer, Robert A.; Robinson, Derek J S Robinson (2010). Algebraic Models for Accounting Systems. local page: Cambridge at the University Press. ISBN 978-981-4287-11-1.
Research Synopsis
This book is being used as the main reference book to integrate my work on Algebra of Systems with pragmatic accounting practice. It turns out that accounting, as described by Prof. Gautam Dasgupta, should be also be described as abstract-counting. For digitally realize these accounting models, one might to refer to the book Digital Accounting: The Effects of the Internet and ERP on Accounting[1]. The idea of The Accounting System as an Algebraic Automaton can also be found in this paper[2].
Excerpts
The book presents and develops a proof-based, algebraic ap- proach to the study of accounting systems. The analysis provides a description of single firms in terms of abstract algebraic objects such as automata. It concentrates on the process of producing infor- mation from data provided by the environment through the double- entry system. This process, although considered by many to be the core of accounting, has often been ignored in accounting re- search.
Decision problems for Accounting Systems
- Decide whether a given transaction is allowable.
- Decide whether a given balance vector is allowable.
- Decide whether a given transaction is feasible.
- Decide whether a final balance vector could actually have occurred by correctly applying a sequence of allowable transactions to a given initial balance vector.
- Decide whether two accounting systems on the same account set are equivalent, i.e., if they have the same feasible transactions and hence the same monoid.
- Decide whether a given accounting system is of a specific type such as those described in Chapter 7.
References
- ↑ Deshmukh, Ashutosh (2006). Digital Accounting: The Effects of the Internet and ERP on Accounting. local page: IRM Press. ISBN 1-59140-740-0.
- ↑ Rambaud, Salvador Cruz; Pérez, José García (2005). "The Accounting System as an Algebraic Automaton". INTERNATIONAL JOURNAL OF INTELLIGENT SYSTEMS. local page: Wiley Periodicals, Inc. 20: 827–842.