Results 21 to 30 of about 1,524,096 (164)

Internal Set Theory IST #Based on Gyper Infinitary Logic With Restricted Modus Ponens Rule

Social Science Research Network, 2022
In this paper we deal with set theory NC # based on gyper infinitary logic with Restricted Modus Ponens Rule.Nonconservative extensions of the canonical internal set theories IST and HST are proposed.
J. Foukzon
semanticscholar   +1 more source

Internalising modified realisability in constructive type theory [PDF]

Logical Methods in Computer Science, 2005
A modified realisability interpretation of infinitary logic is formalised and proved sound in constructive type theory (CTT). The logic considered subsumes first order logic.
Erik Palmgren
doaj   +1 more source

Indexed linear logic and higher-order model checking [PDF]

Electronic Proceedings in Theoretical Computer Science, 2015
In recent work, Kobayashi observed that the acceptance by an alternating tree automaton A of an infinite tree T generated by a higher-order recursion scheme G may be formulated as the typability of the recursion scheme G in an appropriate intersection ...
Charles Grellois, Paul-André Melliès
doaj   +1 more source

An Infinitary Proof Theory of Linear Logic Ensuring Fair Termination in the Linear π-Calculus [PDF]

International Conference on Concurrency Theory, 2022
Fair termination is the property of programs that may diverge"in principle"but that terminate"in practice", i.e. under suitable fairness assumptions concerning the resolution of non-deterministic choices.
L. Ciccone, L. Padovani
semanticscholar   +1 more source

Modality, bisimulation and interpolation in infinitary logic [PDF]

, 1998
Rohit Parikh has been one of the pioneers at the interface of modal and dynamic logic. Bringing dynamic, process-oriented concerns into modal logic has been a major move, whose repercussions are still being felt today.
van Benthem, Johan, van Benthem, J.F.A.K.   +1 more
core   +1 more source

Computing with Infinitary Logic [PDF]

, 1995
Most recursive extensions of the first-order queries converge around two central classes of queries: fixpoint and while. Infinitary logic (with finitely many variables) is a very powerful extension of these languages which provides an elegant unifying ...
Abiteboul, Serge, Vianu, Victor, Victor Vianu, Serge Abiteboul, Moshe Y. Vardi, Vardi, Moshe Y.   +5 more
core   +1 more source

Infinitary equilibrium logic and strongly equivalent logic programs

Artificial Intelligence, 2017
Vladimir Lifschitz, David Pearce, Agustin Valverde   +2 more
exaly   +2 more sources

CoLF Logic Programming as Infinitary Proof Exploration [PDF]

LFMTP@FSCD
Logical Frameworks such as Automath [de Bruijn, 1968] or LF [Harper et al., 1993] were originally conceived as metalanguages for the specification of foundationally uncommitted deductive systems, yielding generic proof checkers.
Zhibo Chen, Frank Pfenning
semanticscholar   +1 more source

The Pebble-Relation Comonad in Finite Model Theory [PDF]

Logical Methods in Computer Science
The pebbling comonad, introduced by Abramsky, Dawar and Wang, provides a categorical interpretation for the k-pebble games from finite model theory.
Yoàv Montacute, Nihil Shah
doaj   +1 more source

Effective Characterizations of Simple Fragments of Temporal Logic Using Carton--Michel Automata [PDF]

Logical Methods in Computer Science, 2013
We present a framework for obtaining effective characterizations of simple fragments of future temporal logic (LTL) with the natural numbers as time domain.
Preugschat Sebastian, Thomas Wilke
doaj   +1 more source