A Phenomenological Calculus for Anisotropic Systems

&
Axiomathes 16 (1-2):215-243 (2006)
  Copy   BIBTEX

Abstract

The phenomenological calculus is a relational paradigm for complex systems, closely related in substance and spirit to Robert Rosen’s own approach. Its mathematical language is multilinear algebra. The epistemological exploration continues in this paper, with the expansion of the phenomenological calculus into the realm of anisotropy.

Categories

Keywords

Reprint years

DOI

10.1007/s10516-005-4697-5

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,219

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Complexity of Null- and Positivstellensatz proofs.Dima Grigoriev & Nicolai Vorobjov - 2001 - Annals of Pure and Applied Logic 113 (1-3):153-160.
The deduction rule and linear and near-linear proof simulations.Maria Luisa Bonet & Samuel R. Buss - 1993 - Journal of Symbolic Logic 58 (2):688-709.
The finite model property for BCI and related systems.Wojciech Buszkowski - 1996 - Studia Logica 57 (2-3):303 - 323.
An introduction to tensor calculus and relativity.Derek F. Lawden - 1967 - London,: Methuen.
Inferentializing consequence.Jaroslav Peregrin - unknown
On reduction systems equivalent to the Lambek calculus with the empty string.Wojciech Zielonka - 2002 - Studia Logica 71 (1):31-46.
On Kreisel's notion of validity in post systems.Dov M. Gabbay - 1976 - Studia Logica 35 (3):285 - 295.
Minimum Propositional Proof Length Is NP-Hard to Linearly Approximate.Michael Alekhnovich, Sam Buss, Shlomo Moran & Toniann Pitassi - 2001 - Journal of Symbolic Logic 66 (1):171-191.
Minimum propositional proof length is NP-Hard to linearly approximate.Michael Alekhnovich, Sam Buss, Shlomo Moran & Toniann Pitassi - 2001 - Journal of Symbolic Logic 66 (1):171-191.
Undecidability of the Problem of Recognizing Axiomatizations of Superintuitionistic Propositional Calculi.Evgeny Zolin - 2014 - Studia Logica 102 (5):1021-1039.
Concept calculus: Much better than.Harvey M. Friedman - unknown
A systems theoretical formal logic for category theory.Carlos Pedro dos Santos Gonçalves & Maria Odete Madeira - unknown
Correspondence results for relational proof systems with application to the Lambek calculus.Wendy MacCaull & Ewa Orłlowska - 2002 - Studia Logica 71 (3):389-414.
Review: V. A. Jankov, On the Extension of the Intuitionist Propositional Calculus to the Classical Calculus, and the Minimal Calculus to the Intuitionist Calculus. [REVIEW]J. G. Anderson - 1973 - Journal of Symbolic Logic 38 (2):331-332.
On Number of Lindenbaum's Oversystems of Propositional and Predicate Calculi.Teodor Stepień - 1985 - Mathematical Logic Quarterly 31 (21‐23):333-344.

Analytics

Added to PP
2009-01-28

Downloads
67 (#235,044)

6 months
5 (#565,734)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

A Relational Theory of the Visible.A. H. Louie - 2022 - Axiomathes 32 (5):793-816.

Add more citations

References found in this work

Essays on Life Itself.Robert Rosen - 2000 - Columbia University Press.

Add more references