Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > Fields of Logic and Computation: Essays Dedicated to Yuri Gurevich on the Occasion of His 70th Birthday > Logics for Two Fragments beyond the Syllogistic Boundary
Fields of Logic and Computation: Essays Dedicated to Yuri Gurevich on the Occasion of His 70th Birthday |
Andreas Blass; Nachum Dershowitz; Wolfgang Reisig
Springer Berlin Heidelberg
Fields of Logic and Computation: Essays Dedicated to Yuri Gurevich on the Occasion of His 70th Birthday
Logics for Two Fragments beyond the Syllogistic Boundary
Authors

Lawrence S. Moss

ARI Id

1664696326596_2768203

Access

Not Available Free

Pages

538-564

DOI

10.1007/978-3-642-15025-8_27

Chapter URL

https://rd.springer.com/chapter/10.1007/978-3-642-15025-8_27

Table of Contents of Book
Showing 1 to 20 of 32 entries
Chapters/HeadingsAuthor(s)PagesInfo
Front Matter
Yuri, Logic, and Computer Science
Andreas Blass; Nachum Dershowitz; Wolfgang Reisig
1-48
Database Theory, Yuri, and Me
Jan Van den Bussche
49-60
Tracking Evidence
Sergei Artemov
61-74
Strict Canonical Constructive Systems
Arnon Avron; Ori Lahav
75-94
Decidable Expansions of Labelled Linear Orderings
Alexis Bès; Alexander Rabinovich
95-107
Existential Fixed-Point Logic, Universal Quantifiers, and Topoi
Andreas Blass
108-134
Three Paths to Effectiveness
Udi Boker; Nachum Dershowitz
135-146
The Quest for a Tight Translation of Büchi to co-Büchi Automata
Udi Boker; Orna Kupferman
147-164
Normalization of Some Extended Abstract State Machines
Patrick Cégielski; Irène Guessarian
165-180
Finding Reductions Automatically
Michael Crouch; Neil Immerman; J. Eliot B. Moss
181-200
On Complete Problems, Relativizations and Logics for Complexity Classes
Anuj Dawar
201-207
Effective Closed Subshifts in 1D Can Be Implemented in 2D
Bruno Durand; Andrei Romashchenko; Alexander Shen
208-226
The Model Checking Problem for Prefix Classes of Second-Order Logic: A Survey
Thomas Eiter; Georg Gottlob; Thomas Schwentick
227-250
A Logic for PTIME and a Parameterized Halting Problem
Yijia Chen; Jörg Flum
251-276
Inferring Loop Invariants Using Postconditions
Carlo Alberto Furia; Bertrand Meyer
277-300
ASMs and Operational Algorithmic Completeness of Lambda Calculus
Marie Ferbus-Zanda; Serge Grigorieff
301-327
Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs
Martin Grohe
328-353
Ibn Sīnā on Analysis: 1. Proof Search. Or: Abstract State Machines as a Tool for History of Logic
Wilfrid Hodges
354-404
Abstract State Machines and the Inquiry Process
James K. Huggins; Charles Wallace
405-413
Chapters/HeadingsAuthor(s)PagesInfo
Showing 1 to 20 of 32 entries
Similar Books
Similar Chapters
Similar Thesis

Similar News

Similar Articles
Similar Article Headings