Sciweavers

680 search results - page 15 / 136
» Complexity of Strict Implication
Sort
View
LICS
1999
IEEE
13 years 12 months ago
Some Decision Problems of Enormous Complexity
We present some new decision and comparison problems of unusually high computational complexity. Most of the problems are strictly combinatorial in nature; others involve basic lo...
Harvey Friedman
JOT
2006
92views more  JOT 2006»
13 years 7 months ago
Complexity, its in the mind of the beholder
Complexity is a much analyzed, much debated, much measured property of softwareintensive products. From a strategic point of view, complexity has implications for the development ...
John D. McGregor
APAL
2008
78views more  APAL 2008»
13 years 7 months ago
Strong normalization of classical natural deduction with disjunctions
This paper proves strong normalization of classical natural deduction with disjunction and permutative conversions, by using CPS-translation and augmentations. By them, this paper...
Koji Nakazawa, Makoto Tatsuta
FSS
2007
79views more  FSS 2007»
13 years 7 months ago
On the characterizations of (S, N)-implications
The characterization of S-implications generated from strong negations presented firstly by Trillas and Valverde in 1985 is wellknown in the literature. In this paper we show tha...
Michal Baczynski, Balasubramaniam Jayaram
ICSM
2005
IEEE
14 years 1 months ago
Strider: Configuration Modelling and Analysis of Complex Systems
This paper describes an approach and support tool for the modelling and analysis of proposed reconfigurations to complex systems. The configuration models used are quick to constr...
Simon Lock