9 found
Order:
Disambiguations:
Iain A. Stewart [5]Iain Stewart [4]Iain M. Stewart [1]
See also:
Profile: Iain Stewart (Macquarie University)
  1.  4
    Iain Stewart (1997). Facing Walter's Dilemma. Ratio Juris 10 (4):397-402.
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  2.  2
    Iain A. Stewart (1997). Logics with Zero‐One Laws That Are Not Fragments of Bounded‐Variable Infinitary Logic. Mathematical Logic Quarterly 43 (2):158-178.
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography  
  3. Iain Stewart (1986). Kelsen and the Exegetical Tradition. In Richard Tur & William L. Twining (eds.), Essays on Kelsen. Clarendon Press 123--46.
     
    Export citation  
     
    My bibliography   1 citation  
  4.  3
    Iain A. Stewart (1997). Regular Subgraphs in Graphs and Rooted Graphs and Definability in Monadic Second‐Order Logic. Mathematical Logic Quarterly 43 (1):1-21.
    We investigate the definability in monadic ∑11 and monadic Π11 of the problems REGk, of whether there is a regular subgraph of degree k in some given graph, and XREGk, of whether, for a given rooted graph, there is a regular subgraph of degree k in which the root has degree k, and their restrictions to graphs in which every vertex has degree at most k, namely REGkk and XREGkk, respectively, for k ≥ 2 . Our motivation partly stems from (...)
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography  
  5.  2
    Iain A. Stewart (1994). Context-Sensitive Transitive Closure Operators. Annals of Pure and Applied Logic 66 (3):277-301.
    We introduce a new logical operator CSTC and show that incorporating this operator into first-order logic enables as to capture the complexity class PSPACE. We also show that by varying how the operator is applied we can capture the complexity classes P, NP, the classes of the Polynomial Hierarchy PH, and PSPACE. As such, the operator CSTC can be regarded as a general purpose operator. We also give applications of these characterizations by showing that P and NP coincide with those (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  6.  4
    Iain Stewart (2011). Sartre, Aron and the Contested Legacy of the Anti-Positivist Turn in French Thought, 19381960. Sartre Studies International 17 (1):41-60.
    Taking as its starting point recent claims that Jean-Paul Sartre's Critique de la Raison Dialectique was written as an attempt to overcome the historical relativism of Raymond Aron's Introduction à la philosophie de l'histoire , the present article traces this covert dialogue back to a fundamental disagreement between the two men over the interpretation of Wilhelm Dilthey's anti-positivist theory of Verstehen or 'understanding'. In so doing it counters a longstanding tendency to emphasise the convergence of Aron and Sartre's philosophical interests (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  7.  0
    H. S. Jones & Iain Stewart (2012). Positive Political Science and the Uses of Political Theory in Post-War France: Raymond Aron in Context. History of European Ideas 39 (1):35-50.
    Summary This article approaches post-war debates about the relationship between normative political theory and empirical political science from a French perspective. It does so by examining Raymond Aron's commentaries on a series of articles commissioned by him for a special issue of the Revue française de science politique on this theme as well as through an analysis of his wartime dialogue with the neo-Thomist philosopher, Jacques Maritain. Following a consideration of Aron's critique of contemporary approaches to this issue in France, (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  8.  0
    Iain A. Stewart (1994). Monotonicity and the Expressibility of NP Operators. Mathematical Logic Quarterly 40 (1):132-140.
    We investigate why similar extensions of first-order logic using operators corresponding to NP-complete decision problems apparently differ in expressibility: the logics capture either NP or LNP. It had been conjectured that the complexity class captured is NP if and only if the operator is monotone. We show that this conjecture is false. However, we provide evidence supporting a revised conjecture involving finite variations of monotone problems.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  9. Iain A. Stewart (1996). The Demise of the Turing Machine in Complexity Theory. In P. J. R. Millican & A. Clark (eds.), Machines and Thought: The Legacy of Alan Turing, Volume 1. Clarendon Press
     
    Export citation  
     
    My bibliography