Results for 'Complexity Theory Problems'

1000+ found
Order:
  1.  75
    Abstract complexity theory and the mind-machine problem.Albert E. Lyngzeidetson & Martin K. Solomon - 1994 - British Journal for the Philosophy of Science 45 (2):549-54.
    In this paper we interpret a characterization of the Gödel speed-up phenomenon as providing support for the ‘Nagel-Newman thesis’ that human theorem recognizers differ from mechanical theorem recognizers in that the former do not seem to be limited by Gödel's incompleteness theorems whereas the latter do seem to be thus limited. However, we also maintain that (currently non-existent) programs which are open systems in that they continuously interact with, and are thus inseparable from, their environment, are not covered by the (...)
    Direct download (12 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  2.  8
    Abstract Complexity Theory and the Mind-Machine Problem.Albert E. Lyngzeidetson - 1994 - British Journal for the Philosophy of Science 45 (2):549-554.
    In this paper we interpret a characterization of the Gödel speed-up phenomenon as providing support for the ‘Nagel-Newman thesis’ that human theorem recognizers differ from mechanical theorem recognizers in that the former do not seem to be limited by Gödel's incompleteness theorems whereas the latter do seem to be thus limited.However, we also maintain that (currently non-existent) programs which are open systems in that they continuously interact with, and are thus inseparable from, their environment, are not covered by the above (...)
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  3.  76
    Computational Complexity Theory and the Philosophy of Mathematics†.Walter Dean - 2019 - Philosophia Mathematica 27 (3):381-439.
    Computational complexity theory is a subfield of computer science originating in computability theory and the study of algorithms for solving practical mathematical problems. Amongst its aims is classifying problems by their degree of difficulty — i.e., how hard they are to solve computationally. This paper highlights the significance of complexity theory relative to questions traditionally asked by philosophers of mathematics while also attempting to isolate some new ones — e.g., about the notion of (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  4.  27
    Infinite Versions of Some Problems from Finite Complexity Theory.Jeffry L. Hirst & Steffen Lempp - 1996 - Notre Dame Journal of Formal Logic 37 (4):545-553.
    Recently, several authors have explored the connections between NP-complete problems for finite objects and the complexity of their analogs for infinite objects. In this paper, we will categorize infinite versions of several problems arising from finite complexity theory in terms of their recursion theoretic complexity and proof theoretic strength. These infinite analogs can behave in a variety of unexpected ways.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  5.  16
    Biological hypercomputation: A new research problem in complexity theory.Carlos E. Maldonado & Nelson A. Gómez Cruz - 2015 - Complexity 20 (4):8-18.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   4 citations  
  6.  19
    A Step towards a Complexity Theory for Analog Systems.K. Meer & M. Gori - 2002 - Mathematical Logic Quarterly 48 (S1):45-58.
    Recent years have seen an increasing interest in the study of continuous-time computational models. However, not so much has been done with respect to setting up a complexity theoretic framework for such models. The present paper intends to go a step into this direction. We consider problems over the real numbers which we try to relate to Lyapunov theory for dynamical systems: The global minimizers of particular energy functions are supposed to give solutions of the problem. The (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  7.  12
    Harnessing Computational Complexity Theory to Model Human Decision‐making and Cognition.Juan Pablo Franco & Carsten Murawski - 2023 - Cognitive Science 47 (6):e13304.
    A central aim of cognitive science is to understand the fundamental mechanisms that enable humans to navigate and make sense of complex environments. In this letter, we argue that computational complexity theory, a foundational framework for evaluating computational resource requirements, holds significant potential in addressing this challenge. As humans possess limited cognitive resources for processing vast amounts of information, understanding how humans perform complex cognitive tasks requires comprehending the underlying factors that drive information processing demands. Computational complexity (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  8. Problems for a quantificational theory of complex demonstratives.David Braun - 2008 - Philosophical Studies 140 (3):335 - 358.
    This paper presents a number of objections to Jeffrey King's quantificational theory of complex demonstratives. Some of these objections have to do with modality, whereas others concern attitude ascriptions. Various possible replies are considered. The debate between quantificational theorists and direct reference theorists over complex demonstratives is compared with recent debates concerning definite descriptions.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  9. Persisting problems for a quantificational theory of complex demonstratives.David Braun - 2008 - Philosophical Studies 141 (2):243-262.
    I criticized Jeffrey King’s theory of complex demonstratives in “Problems for a Quantificational Theory of Complex Demonstratives.” King replied in “Complex Demonstratives as Quantifiers: Objections and Replies.” I here comment on some of King’s replies.
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  10.  57
    Von Neumann, Gödel and complexity theory.Alasdair Urquhart - 2010 - Bulletin of Symbolic Logic 16 (4):516-530.
    Around 1989, a striking letter written in March 1956 from Kurt Gödel to John von Neumann came to light. It poses some problems about the complexity of algorithms; in particular, it asks a question that can be seen as the first formulation of the P=?NP question. This paper discusses some of the background to this letter, including von Neumann's own ideas on complexity theory. Von Neumann had already raised explicit questions about the complexity of Tarski's (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  11.  18
    Jervis on Complexity Theory.Richard A. Posner - 2012 - Critical Review: A Journal of Politics and Society 24 (3):367-373.
    The correct solution to complex problems, such as those involved in international relations, can generally be discovered ex post but not predicted ex ante. Economics and game theory attempt to model such complexity, but have difficulty taking into account psychological subtleties, the myriad factors that each agent considers when making a decision, and cultural differences. And understanding that one is dealing with a system—that is, with interacting factors instead of with insulated monads—may not make the questions any (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  12.  43
    Strong isomorphism reductions in complexity theory.Sam Buss, Yijia Chen, Jörg Flum, Sy-David Friedman & Moritz Müller - 2011 - Journal of Symbolic Logic 76 (4):1381-1402.
    We give the first systematic study of strong isomorphism reductions, a notion of reduction more appropriate than polynomial time reduction when, for example, comparing the computational complexity of the isomorphim problem for different classes of structures. We show that the partial ordering of its degrees is quite rich. We analyze its relationship to a further type of reduction between classes of structures based on purely comparing for every n the number of nonisomorphic structures of cardinality at most n in (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  13.  55
    Higher complexity search problems for bounded arithmetic and a formalized no-gap theorem.Neil Thapen - 2011 - Archive for Mathematical Logic 50 (7):665-680.
    We give a new characterization of the strict $$\forall {\Sigma^b_j}$$ sentences provable using $${\Sigma^b_k}$$ induction, for 1 ≤ j ≤ k. As a small application we show that, in a certain sense, Buss’s witnessing theorem for strict $${\Sigma^b_k}$$ formulas already holds over the relatively weak theory PV. We exhibit a combinatorial principle with the property that a lower bound for it in constant-depth Frege would imply that the narrow CNFs with short depth j Frege refutations form a strict hierarchy (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  14.  35
    Bounded arithmetic, propositional logic, and complexity theory.Jan Krajíček - 1995 - New York, NY, USA: Cambridge University Press.
    This book presents an up-to-date, unified treatment of research in bounded arithmetic and complexity of propositional logic, with emphasis on independence proofs and lower bound proofs. The author discusses the deep connections between logic and complexity theory and lists a number of intriguing open problems. An introduction to the basics of logic and complexity theory is followed by discussion of important results in propositional proof systems and systems of bounded arithmetic. More advanced topics are (...)
    Direct download  
     
    Export citation  
     
    Bookmark   21 citations  
  15.  80
    Theories of complexity and their problems.Hans Poser - 2007 - Frontiers of Philosophy in China 2 (3):423-436.
    Complexity theories are on the way to establish a new worldview—processes instead of objects, history and uniqueness of everything instead of repetition and lawlikeness are the elements. These theories from deterministic chaos via the dissipative structures, the theory of catastrophes, self organization and synergetics are mathematical models, connected with a new understanding of science. They are characterized by new fundamental commitments of sciences. But at the same time, they are characterized by epistemic boundaries.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  16.  32
    A call for complexity: integrated models to solve complex policy problems.Liz Johnson - 2015 - Mind and Society 14 (2):259-271.
    This research calls for attention to complexity theory and the integration of complexity methodologies in policy research. A complexity approach in research practice requires a systems worldview and recognition of non-linearity, networks, self-organization, emergence, and feedback in policy. Simply, if a phenomenon is complex and can be explored from varied contexts and scales, the conceptual frame, and the methodical approach should be able to address the complexity. Complexity science has the capacity to account for (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  17.  7
    Theory of complex problems.Carlos Eduardo Maldonado - 2022 - Cinta de Moebio 74:109-120.
    Resumen Este texto formula una teoría de los problemas complejos, que trata de distinguir cuándo y cómo un problema puede ser dicho como complejo y cuándo no. Un mundo diferente de suma cero, altamente entreverado, con múltiples sensibilidades y con crisis sistémicas y sistemáticas demanda una teoría de problemas complejos, inexistente a la fecha. Negativamente, las comprensiones o aproximaciones analíticas son insuficientes. Es precisa una estructura sintética sobre los problemas. Para ello, tres ejes emergen como referencias: la teoría matemática de (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  18.  25
    On the Relations Between Discrete and Continuous Complexity Theory.Klaus Meer - 1995 - Mathematical Logic Quarterly 41 (2):281-286.
    Relations between discrete and continuous complexity models are considered. The present paper is devoted to combine both models. In particular we analyze the 3-Satisfiability problem. The existence of fast decision procedures for this problem over the reals is examined based on certain conditions on the discrete setting. Moreover we study the behaviour of exponential time computations over the reals depending on the real complexity of 3-Satisfiability. This will be done using tools from complexity theory over the (...)
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  19.  45
    Participation as chaos: Lessons from the principles of complexity theory for democracy.Renee Houston - 2001 - World Futures 57 (4):315-338.
    Current organizational communication theorists and practitioners seek to remedy organizational ills by advancing democracy within the workplace. Specifically, organizational democracy has been introduced with a variety of goals in mind: improving representation, increasing job satisfaction, improving productivity, and reducing costs. Although democracy emerges in myriad forms, theorists are still uncertain as to how to involve employees in the process and produce observable results. In this article, recent developments in complexity theory are invoked to both illuminate and resolve (...) on the perspective of workplace democracy. The article closes by showing how complexity theory concepts can be used to encourage democratic practices in organizations. Ultimately, complexity theory is used to shed light on the processes surrounding the considerable problem solving and experimentation required to implement democratic practices. (shrink)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  20.  57
    Game theory, complexity, and simplicity part II: Problems and applications.Martin Shubik - 1998 - Complexity 3 (3):36-45.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  21.  34
    Generic Complexity of Undecidable Problems.Alexei G. Myasnikov & Alexander N. Rybalov - 2008 - Journal of Symbolic Logic 73 (2):656 - 673.
    In this paper we study generic complexity of undecidable problems. It turns out that some classical undecidable problems are, in fact, strongly undecidable, i.e., they are undecidable on every strongly generic subset of inputs. For instance, the classical Halting Problem is strongly undecidable. Moreover, we prove and analog of the Rice theorem for strongly undecidable problems, which provides plenty of examples of strongly undecidable problems. Then we show that there are natural super-undecidable problems. i.e., (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  22.  10
    Looking for an Analogue of Rice's Theorem in Circuit Complexity Theory.F. Stephan & B. Borchert - 2000 - Mathematical Logic Quarterly 46 (4):489-504.
    Rice's Theorem says that every nontrivia semantic property of programs is undecidable. In this spirit we show the following: Every nontrivia absolute counting property of circuits is UP-hard with respect to polynomial-time Turing reductions. For generators [31] we show a perfect analogue of Rice's Theorem.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  23.  53
    Complex-Domain Semiclassical Theory: Application to Time-Dependent Barrier Tunneling Problems[REVIEW]Kin'ya Takahashi & Kensuke S. Ikeda - 2001 - Foundations of Physics 31 (1):177-201.
    Semiclassical theory based upon complexified classical mechanics is developed for periodically time-dependent scattering systems, which are minimal models of multi-dimensional systems. Semiclassical expression of the wave-matrix is derived, which is represented as the sum of the contributions from classical trajectories, where all the dynamical variables as well as the time are extended to the complex-domain. The semiclassical expression is examined by a periodically perturbed 1D barrier system and an excellent agreement with the fully quantum result is confirmed. In a (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  24. Problems for Russellian Act-Type Theories.Arvid Båve - forthcoming - Inquiry: An Interdisciplinary Journal of Philosophy.
    I here discuss two problems facing Russellian act-type theories of propositions, and argue that Fregean act-type theories are better equipped to deal with them. The first relates to complex singular terms like '2+2', which turn out not to pose any special problem for Fregeans at all, whereas Soames' theory currently has no satisfactory way of dealing with them (particularly, with such "mixed" propositions as the proposition that 2+2 is greater than 3). Admittedly, one possibility stands out as the (...)
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  25.  2
    Consistent-labeling problems and their algorithms: Expected-complexities and theory-based heuristics.Bernard Nudel - 1983 - Artificial Intelligence 21 (1-2):135-178.
  26. Can A Quantum Field Theory Ontology Help Resolve the Problem of Consciousness?Anand Rangarajan - 2019 - In Siddheshwar Rameshwar Bhatt (ed.), Quantum Reality and Theory of Śūnya. Springer. pp. 13-26.
    The hard problem of consciousness arises in most incarnations of present day physicalism. Why should certain physical processes necessarily be accompanied by experience? One possible response is that physicalism itself should be modified in order to accommodate experience: But, modified how? In the present work, we investigate whether an ontology derived from quantum field theory can help resolve the hard problem. We begin with the assumption that experience cannot exist without being accompanied by a subject of experience (SoE). While (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  27.  42
    Complexity and sustainability.Jennifer Wells - 2013 - New York: Routledge.
    Introduction -- Elucidating complexity theories -- Complexity in the natural sciences -- Complexity in social theory -- Towards transdisciplinarity -- Complexity in philosophy: complexification and the limits to knowledge -- Complexity in ethics -- Earth in the anthropocene -- Complexity and climate change -- American dreams, ecological nightmares and new visions -- Complexity and sustainability: wicked problems, gordian knots and synergistic solutions -- Conclusion.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   4 citations  
  28. Complexity as a new framework for emotion theories.Giovanna Colombetti - 2003 - Logic and Philosophy of Science 1 (1).
    In this paper I suggest that several problems in the study of emotion depend on a lack of adequate analytical tools, in particular on the tendency of viewing the organism as a modular and hierarchical system whose activity is mainly constituted by strictly sequential causal events. I argue that theories and models based on this view are inadequate to account for the complex reciprocal influences of the many ingredients that constitute emotions. Cognitive processes, feelings and bodily states are so (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  29.  88
    Alternative axiomatics and complexity of deliberative stit theories.Philippe Balbiani, Andreas Herzig & Nicolas Troquard - 2008 - Journal of Philosophical Logic 37 (4):387 - 406.
    We propose two alternatives to Xu’s axiomatization of Chellas’s STIT. The first one simplifies its presentation, and also provides an alternative axiomatization of the deliberative STIT. The second one starts from the idea that the historic necessity operator can be defined as an abbreviation of operators of agency, and can thus be eliminated from the logic of Chellas’s STIT. The second axiomatization also allows us to establish that the problem of deciding the satisfiability of a STIT formula without temporal operators (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   30 citations  
  30.  22
    Capturing Collaborative Challenges: Designing Complexity-Sensitive Theories of Change for Cross-Sector Partnerships.Amelia Clarke & Andrew Crane - 2018 - Journal of Business Ethics 150 (2):315-332.
    Systems change requires complex interventions. Cross-sector partnerships face the daunting task of addressing complex societal problems by aligning different backgrounds, values, ideas and resources. A major challenge for CSPs is how to link the type of partnership to the intervention needed to drive change. Intervention strategies are thereby increasingly based on Theories of Change. Applying ToCs is often a donor requirement, but it also reflects the ambition of a partnership to enhance its transformative potential. The current use of ToCs (...)
    Direct download  
     
    Export citation  
     
    Bookmark   16 citations  
  31.  62
    Foucault as complexity theorist: Overcoming the problems of classical philosophical analysis.Mark Olssen - 2008 - Educational Philosophy and Theory 40 (1):96–117.
    This article explores the affinities and parallels between Foucault's Nietzschean view of history and models of complexity developed in the physical sciences in the twentieth century. It claims that Foucault's rejection of structuralism and Marxism can be explained as a consequence of his own approach which posits a radical ontology whereby the conception of the totality or whole is reconfigured as an always open, relatively borderless system of infinite interconnections, possibilities and developments. His rejection of Hegelianism, as well as (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  32. Problems in epicurus' theory of vision.Jeremy Anderson - manuscript
    Epicurus emphatically asserts the veracity of perception, including visual perception, yet most of the literature on Epicurus’ atomistic theory of vision pays scant attention to what Epicurus believed transpires outside the body that leads to it. The treatments by DeWitt, Everson, Hicks, and Rist are all very brief; Glidden focuses primarily on the processes occurring inside the perceiver; and while the discussions by Asmis and Bailey are more detailed, they hardly more than note in passing that the process is (...)
     
    Export citation  
     
    Bookmark  
  33.  33
    Capturing Collaborative Challenges: Designing Complexity-Sensitive Theories of Change for Cross-Sector Partnerships.Rob van Tulder & Nienke Keen - 2018 - Journal of Business Ethics 150 (2):315-332.
    Systems change requires complex interventions. Cross-sector partnerships face the daunting task of addressing complex societal problems by aligning different backgrounds, values, ideas and resources. A major challenge for CSPs is how to link the type of partnership to the intervention needed to drive change. Intervention strategies are thereby increasingly based on Theories of Change. Applying ToCs is often a donor requirement, but it also reflects the ambition of a partnership to enhance its transformative potential. The current use of ToCs (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   21 citations  
  34. Theory of Everything, Ultimate Reality and the End of Humanity: Extended Sustainability by the Universal Science of Complexity.Andrei P. Kirilyuk - 2017 - Beau Bassin: LAP LAMBERT Academic Publishing.
    Instead of postulated fixed structures and abstract principles of usual positivistic science, the unreduced diversity of living world reality is consistently derived as dynamically emerging results of unreduced interaction process development, starting from its simplest configuration of two coupled homogeneous protofields. The dynamically multivalued, or complex and intrinsically chaotic, nature of these real interaction results extends dramatically the artificially reduced, dynamically single-valued projection of standard theory and solves its stagnating old and accumulating new problems, “mysteries” and “paradoxes” within (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  35.  9
    Decision Problems for Equational Theories of Relation Algebras.H. Andréka, Steven R. Givant & I. Németi - 1997 - American Mathematical Soc..
    This work presents a systematic study of decision problems for equational theories of algebras of binary relations (relation algebras). For example, an easily applicable but deep method, based on von Neumann's coordinatization theorem, is developed for establishing undecidability results. The method is used to solve several outstanding problems posed by Tarski. In addition, the complexity of intervals of equational theories of relation algebras with respect to questions of decidability is investigated. Using ideas that go back to Jonsson (...)
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  36.  7
    Capturing Collaborative Challenges: Designing Complexity-Sensitive Theories of Change for Cross-Sector Partnerships.Nienke Keen & Rob Tulder - 2018 - Journal of Business Ethics 150 (2):315-332.
    Systems change requires complex interventions. Cross-sector partnerships (CSPs) face the daunting task of addressing complex societal problems by aligning different backgrounds, values, ideas and resources. A major challenge for CSPs is how to link the type of partnership to the intervention needed to drive change. Intervention strategies are thereby increasingly based on Theories of Change (ToCs). Applying ToCs is often a donor requirement, but it also reflects the ambition of a partnership to enhance its transformative potential. The current use (...)
    Direct download  
     
    Export citation  
     
    Bookmark   15 citations  
  37.  19
    On the complexity of the pancake problem.Fuxiang Yu - 2007 - Mathematical Logic Quarterly 53 (4):532-546.
    We study the computational complexity of finding a line that bisects simultaneously two sets in the two-dimensional plane, called the pancake problem, using the oracle Turing machine model of Ko. We also study the basic problem of bisecting a set at a given direction. Our main results are: (1) The complexity of bisecting a nice (thick) polynomial-time approximable set at a given direction can be characterized by the counting class #P. (2) The complexity of bisecting simultaneously two (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  38.  54
    Cross‐National Comparisons of Complex Problem‐Solving Strategies in Two Microworlds.C. Dominik Güss, Ma Teresa Tuason & Christiane Gerhard - 2010 - Cognitive Science 34 (3):489-520.
    Research in the fields of complex problem solving (CPS) and dynamic decision making using microworlds has been mainly conducted in Western industrialized countries. This study analyzes the CPS process by investigating thinking‐aloud protocols in five countries. Participants were 511 students from Brazil, Germany, India, the Philippines, and the United States who worked on two microworlds. On the basis of cultural‐psychological theories, specific cross‐national differences in CPS strategies were hypothesized. Following theories of situatedness of cognition, hypotheses about the specific frequency of (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  39. Decision Theory in Light of Newcomb’s Problem.Paul Horwich - 1985 - Philosophy of Science 52 (3):431-450.
    Should we act only for the sake of what we might bring about (causal decision theory); or is it enough for a decent motive that our action is highly correlated with something desirable (evidential decision theory)? The conflict between these points of view is embodied in Newcomb's problem. It is argued here that intuitive evidence from familiar decision contexts does not enable us to settle the issue, since the two theories dictate the same results in normal circumstances. Nevertheless, (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   15 citations  
  40. Complexity-based Theories of Emergence: Criticisms and Constraints.Kari L. Theurer - 2014 - International Studies in the Philosophy of Science 28 (3):277-301.
    In recent years, many philosophers of science have attempted to articulate a theory of non-epistemic emergence that is compatible with mechanistic explanation and incompatible with reductionism. The 2005 account of Fred C. Boogerd et al. has been particularly influential. They argued that a systemic property was emergent if it could not be predicted from the behaviour of less complex systems. Here, I argue that Boogerd et al.'s attempt to ground emergence in complexity guarantees that we will see emergence, (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  41.  38
    Complexity of equational theory of relational algebras with projection elements.Szabolcs Mikulás, Ildikó Sain & Andras Simon - 1992 - Bulletin of the Section of Logic 21 (3):103-111.
    The class \ of t rue p airing a lgebras is defined to be the class of relation algebras expanded with concrete set theoretical projection functions. The main results of the present paper is that neither the equational theory of \ nor the first order theory of \ are decidable. Moreover, we show that the set of all equations valid in \ is exactly on the \ level. We consider the class \ of the relation algebra reducts of (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  42.  72
    Complexity, Relevance and Character: Problems with teaching the ad hominem fallacy.Stephen de Wijze - 2003 - Educational Philosophy and Theory 35 (1):31-56.
  43.  44
    Problems of ontological complexity of law.Jerzy Wroblewski - 1986 - Theoria 1 (3):641-654.
    There are five basic types of ontology of law identified in relation with the singling out simpIe ontological objects in a strong or weak sense, dualist ontological objects, and complex ontalogical objects in a strong or weak sense. The conceptians of law far mulated in the theories/philosophies/ of law are ascribed to these five types.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  44. Unified complex-dynamical theory of financial, economic, and social risks and their efficient management: Reason-based governance for sustainable development.Andrei P. Kirilyuk - 2017 - In Theory of Everything, Ultimate Reality and the End of Humanity: Extended Sustainability by the Universal Science of Complexity. Beau Bassin: LAP LAMBERT Academic Publishing. pp. 194-199.
    An extended analysis compared to observations shows that modern “globalised” world civilisation has passed through the invisible “complexity threshold”, after which usual “spontaneous”, empirically driven kind of development (“invisible hand” etc.) cannot continue any more without major destructive tendencies. A much deeper, non-simplified understanding of real interaction complexity is necessary in order to cope with such globalised world development problems. Here we introduce the universal definition, fundamental origin, and dynamic equations for a major related quantity of (systemic) (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  45. The Complexity of Environment in Social Systems Theory.B. Freyer & R. L. Paxton - 2012 - Constructivist Foundations 8 (1):55-57.
    Open peer commentary on the article “Observing Environments” by Hugo F. Alrøe & Egon Noe. Upshot: We discuss the environmental terminology of Jakob von Uexküll in the context of Alrøe Egon Noe’s reflections, and to examine more deeply the multi-perspectivity that arises from a combination of von Uexküll’s and Luhmann’s systems theories. The complexity yielded by an unpacking of the term “environment” sheds light on the difficulties in finding common understandings for solving wicked problems.
     
    Export citation  
     
    Bookmark  
  46. A conceptual construction of complexity levels theory in spacetime categorical ontology: Non-Abelian algebraic topology, many-valued logics and dynamic systems. [REVIEW]R. Brown, J. F. Glazebrook & I. C. Baianu - 2007 - Axiomathes 17 (3-4):409-493.
    A novel conceptual framework is introduced for the Complexity Levels Theory in a Categorical Ontology of Space and Time. This conceptual and formal construction is intended for ontological studies of Emergent Biosystems, Super-complex Dynamics, Evolution and Human Consciousness. A claim is defended concerning the universal representation of an item’s essence in categorical terms. As an essential example, relational structures of living organisms are well represented by applying the important categorical concept of natural transformations to biomolecular reactions and relational (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  47.  51
    The symmetry problem: current theories and prospects.Richard Breheny, Nathan Klinedinst, Jacopo Romoli & Yasutada Sudo - 2018 - Natural Language Semantics 26 (2):85-110.
    The structural approach to alternatives :669–690, 2007; Fox and Katzir in Nat Lang Semant 19:87–107, 2011; Katzir in Semantics, pragmatics and the case of scalar implicatures, Palgrave Macmillan, London, pp 40–71, 2014) is the most developed attempt in the literature at solving the symmetry problem of scalar implicatures. Problematic data with indirect and particularised scalar implicatures have however been raised :249–270, 2015). To address these problems, Trinh and Haida proposed to augment the theory with the Atomicity Constraint. Here (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   11 citations  
  48. Moral theory in ethical decision making: Problems, clarifications and recommendations from a psychological perspective. [REVIEW]Maureen Miner & Agnes Petocz - 2003 - Journal of Business Ethics 42 (1):11-25.
    Psychological theory and research in ethical decision making and ethical professional practice are presently hampered by a failure to take appropriate account of an extensive background in moral philosophy. As a result, attempts to develop models of ethical decision making are left vulnerable to a number of criticisms: that they neglect the problems of meta-ethics and the variety of meta-ethical perspectives; that they fail clearly and consistently to differentiate between descriptive and prescriptive accounts; that they leave unexplicated the (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   24 citations  
  49.  15
    The symmetry problem: current theories and prospects.Richard Breheny, Nathan Klinedinst, Jacopo Romoli & Yasutada Sudo - 2018 - Natural Language Semantics 26 (2):85-110.
    The structural approach to alternatives :669–690, 2007; Fox and Katzir in Nat Lang Semant 19:87–107, 2011; Katzir in Semantics, pragmatics and the case of scalar implicatures, Palgrave Macmillan, London, pp 40–71, 2014) is the most developed attempt in the literature at solving the symmetry problem of scalar implicatures. Problematic data with indirect and particularised scalar implicatures have however been raised :249–270, 2015). To address these problems, Trinh and Haida proposed to augment the theory with the Atomicity Constraint. Here (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  50.  15
    Control versus Complexity: Approaches to the Carbon Dioxide Problem at IIASA.Isabell Schrickel - 2017 - Berichte Zur Wissenschaftsgeschichte 40 (2):140-159.
    Translation abstractSummary: Control versus Complexity: Approaches to the Carbon Dioxide Problem at IIASA. In the 1970s and 1980s the International Institute for Applied Systems Analysis (IIASA) hosted several research projects, workshops and conferences in order to discuss the implications of rising carbon dioxide concentrations in the Earth's atmosphere. A number of distinguished scholars, some of whom later became prominent protagonists within the United Nations’ Intergovernmental Panel on Climate Change (IPCC) and sustainability communities more generally, participated in these debates. Since (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
1 — 50 / 1000