Results 251 to 260 of about 360,829 (301)
Some of the next articles are maybe not open access.
Determinate logic and the Axiom of Choice
Annals of Pure and Applied Logic, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
On determining symmetries in inputs of logic circuits
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1994We propose a method for computing maximal sets of symmetric inputs in logic circuits, using a test generation procedure for single stuck-at faults. The method is enhanced by a heuristic that can be used to identify nonsymmetric inputs and thus reduce the number of inputs for which test generation has to be carried out.
Irith Pomeranz, Sudhakar M. Reddy
openaire +2 more sources
Linguistics and Philosophy, 1983
Determiners are the basic linguistic expressions relating predicates: ''all P1 are P2'', ''five or more P1 are P2'', ''not enough P1 are P2'', etc.. Within this class are found, in particular, both the traditional and non- standard logical quantifiers.
openaire +3 more sources
Determiners are the basic linguistic expressions relating predicates: ''all P1 are P2'', ''five or more P1 are P2'', ''not enough P1 are P2'', etc.. Within this class are found, in particular, both the traditional and non- standard logical quantifiers.
openaire +3 more sources
Locally Determined Logic Programs
1999In general, the set of stable models of a recursive propositional logic program can be quite complex. For example, it follows from results of Marek, Nerode, and Remmel [8] that there exists finite predicate logic programs and recursive propositional logic programs which have stable models but no hyperarithmetic stable models.
Douglas A. Cenzer +2 more
openaire +2 more sources
The logical form of determiners
Journal of Philosophical Logic, 1995An attempt at finding syntactical means for formulating logical laws obeyed by such natural language determiners as ``many'', ``most'', ``few'', ``more than'', \dots. A special language is introduced which is constructed as an extension of the first-order predicate language; the expressivity of this extension is, however, acquired via mixed use of ...
openaire +3 more sources
Determinism and the Origins of Temporal Logic
2000The founder of symbolic temporal logic, A. N. Prior was to a great extent motivated by philosophical concerns. The philosophical problem with which he was most concerned was determinism versus free will. The aim of this paper is to point out some crucial interrelations between this philosophical problem and temporal logic.
Braüner, Torben +2 more
openaire +3 more sources
Logic for structure determination
Tetrahedron, 1991Abstract A program for structure elucidation of organic molecules is described. The main source of input data relies on NMR carbon-proton correlation spectra. The methodology is illustrated for two indole alkaloids.
Jean-Marc Nuzillard, Massiot Georges
openaire +1 more source
?-Terms, logic, determiners and quantifiers
Journal of Logic, Language and Information, 1992In this paper, a theory T H based on combining type freeness with logic is introduced and is then used to build a theory of properties which is applied to determiners and quantifiers.
openaire +3 more sources
Logical problem determination in an SNA network
Proceedings of the May 16-19, 1983, national computer conference on - AFIPS '83, 1983Until recently, problem determination on a systems network architecture (SNA) network has dealt mostly with error detection on physical network components. Logical-error detection mechanisms associated with logical-network (software-related) errors were not adequately provided until the recent announcement of a new on-line interactive package called ...
Robert A. Weingarten +1 more
openaire +2 more sources

