Results 11 to 20 of about 781,604 (289)
Logics in Computer Science [PDF]
, 2010 In this thesis, we introduce and examine four new temporal logic formalisms that can be used as specification languages for the automated verification of the reliability of hardware and software designs with respect to a desired behavior. The work is organized in two parts.
Fabio Mogavero
openalex +3 more sources
The prospects for mathematical logic in the twenty-first century [PDF]
, 2001 The four authors present their speculations about the future developments of mathematical logic in the twenty-first century. The areas of recursion theory, proof theory and logic for computer science, model theory, and set theory are discussed ...
Alexander S. Kechris +4 more
core +3 more sources
On the Unusual Effectiveness of Logic in Computer Science [PDF]
Bulletin of Symbolic Logic, 2001 In 1960, E. P. Wigner, a joint winner of the 1963 Nobel Prize for Physics, published a paper titled On the Unreasonable Effectiveness of Mathematics in the Natural Sciences [61]. This paper can be construed as an examination and affirmation of Galileo's tenet that “The book of nature is written in the language of mathematics”.
Halpern, Joseph Y. +5 more
openaire +2 more sources
A Sound and Complete Axiomatization of Majority-n Logic [PDF]
, 2015 Manipulating logic functions via majority operators recently drew the attention of researchers in computer science. For example, circuit optimization based on majority operators enables superior results as compared to traditional logic systems. Also, the
Amaru, Luca +3 more
core +2 more sources
Modal logics are coalgebraic [PDF]
, 2008 Applications of modal logics are abundant in computer science, and a large number of structurally different modal logics have been successfully employed in a diverse spectrum of application contexts.
Cirstea, Corina +4 more
core +5 more sources
Proof equivalence in MLL is PSPACE-complete [PDF]
, 2016 MLL proof equivalence is the problem of deciding whether two proofs in multiplicative linear logic are related by a series of inference permutations. It is also known as the word problem for star-autonomous categories. Previous work has shown the problem
Heijltjes, Willem, Houston, Robin
core +1 more source
Logicism and the Development of Computer Science [PDF]
, 2002 This paper argues for the thesis that ideas originating in the philosophy of mathematics have proved very helpful for the development of computer science. In particular, logicism, the view that mathematics can be reduced to logic, was developed by Frege and Russell, long before computers were invented, and yet many of the ideas of logicism have been ...
openaire +2 more sources
Tarski's influence on computer science
, 2006 The influence of Alfred Tarski on computer science was indirect but significant in a number of directions and was in certain respects fundamental. Here surveyed is the work of Tarski on the decision procedure for algebra and geometry, the method of ...
Prakash Panangaden, Solomon Feferman
core +2 more sources
Complexity of ITL model checking: some well-behaved fragments of the interval logic HS
, 2015 Model checking has been successfully used in many computer science fields, including artificial intelligence, theoretical computer science, and databases.
Molinari, A., Montanari, A., Peron, A.
core +1 more source