Results 1 to 10 of about 776,600 (243)
Linear logic in computer science [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
William Steingartner +3 more
openaire +3 more sources
The prospects for mathematical logic in the twenty-first century [PDF]
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
A Sound and Complete Axiomatization of Majority-n Logic [PDF]
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
Specifying and Verifying Properties of Space - Extended Version [PDF]
The interplay between process behaviour and spatial aspects of computation has become more and more relevant in Computer Science, especially in the field of collective adaptive systems, but also, more generally, when dealing with systems distributed in ...
Ciancia, Vincenzo +3 more
core +2 more sources
Introduction to Iltis: An Interactive, Web-Based System for Teaching Logic
Logic is a foundation for many modern areas of computer science. In artificial intelligence, as a basis of database query languages, as well as in formal software and hardware verification --- modelling scenarios using logical formalisms and inferring ...
Geck, Gaetano +5 more
core +1 more source
Complexity of ITL model checking: some well-behaved fragments of the interval logic HS
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
Modal logics are coalgebraic [PDF]
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
Higher-Order Termination: from Kruskal to Computability [PDF]
Termination is a major question in both logic and computer science. In logic, termination is at the heart of proof theory where it is usually called strong normalization (of cut elimination).
C. Borralleras +13 more
core +9 more sources
Tarski's influence on computer science
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
Proof equivalence in MLL is PSPACE-complete [PDF]
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

