Sciweavers

362 search results - page 2 / 73
» Formal Theories for Linear Algebra
Sort
View
CSL
2005
Springer
13 years 10 months ago
Feasible Proofs of Matrix Properties with Csanky's Algorithm
We show that Csanky’s fast parallel algorithm for computing the characteristic polynomial of a matrix can be formalized in the logical theory LAP, and can be proved correct in LA...
Michael Soltys
AMAST
2006
Springer
13 years 9 months ago
Fork Algebras as a Sufficiently Rich Universal Institution
Algebraization of computational logics in the theory of fork algebras has been a research topic for a while. This research allowed us to interpret classical first-order logic, seve...
Carlos López Pombo, Marcelo F. Frias
LFCS
2009
Springer
13 years 9 months ago
A Bialgebraic Approach to Automata and Formal Language Theory
A bialgebra is a structure which is simultaneously an algebra and a coalgebra, such that the algebraic and coalgebraic parts are compatible. Bialgebras are usually studied over a ...
James Worthington
AB
2008
Springer
13 years 11 months ago
Neural Algebra and Consciousness: A Theory of Structural Functionality in Neural Nets
Abstract. Thoughts are spatio-temporal patterns of coalitions of firing neurons and their interconnections. Neural algebras represent these patterns as formal algebraic objects, a...
Erwin Engeler
FOSSACS
2004
Springer
13 years 10 months ago
Duality for Labelled Markov Processes
Labelled Markov processes (LMPs) are automata whose transitions are given by probability distributions. In this paper we present a ‘universal’ LMP as the spectrum of a commutat...
Michael W. Mislove, Joël Ouaknine, Dusko Pavl...