Difference between revisions of "Book/Algebraic Models for Accounting Systems"
Jump to navigation
Jump to search
| Line 22: | Line 22: | ||
#Decide whether a given balance vector is allowable. | #Decide whether a given balance vector is allowable. | ||
#Decide whether a given transaction is feasible. | #Decide whether a given transaction is feasible. | ||
#Decide whether a final balance vector could actually have | #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 | #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. | #Decide whether a given accounting system is of a specific type such as those described in Chapter 7. | ||
</noinclude> | </noinclude> | ||
Revision as of 04:34, 7 September 2021
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.
The following sections are some excerpts from this book.
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.