Results 1  10
of
61
Infinitary Rewriting and Cyclic Graphs
 Electronic Notes in Theoretical Computer Science
, 1995
"... Infinitary rewriting allows infinitely large terms and infinitely long reduction sequences. There are two computational motivations for studying these: the infinite data structures implicit in lazy functional programming, and the use of rewriting of possibly cyclic graphs as an implementation techni ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Infinitary rewriting allows infinitely large terms and infinitely long reduction sequences. There are two computational motivations for studying these: the infinite data structures implicit in lazy functional programming, and the use of rewriting of possibly cyclic graphs as an implementation
Infinitary rewriting: Foundations revisited
 PROCEEDINGS OF THE 21ST INTERNATIONAL CONFERENCE ON REWRITING TECHNIQUES AND APPLICATIONS, LEIBNIZ INTERNATIONAL PROCEEDINGS IN INFORMATICS (LIPICS
, 2010
"... Infinitary Term Rewriting allows to express infinitary terms and infinitary reductions that converge to them. As their notion of transfinite reduction in general, and as binary relations in particular two concepts have been studied in the past: strongly and weakly convergent reductions, and in the ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Infinitary Term Rewriting allows to express infinitary terms and infinitary reductions that converge to them. As their notion of transfinite reduction in general, and as binary relations in particular two concepts have been studied in the past: strongly and weakly convergent reductions
ANTIREALISM AND INFINITARY PROOFS
"... Abstract in the discussion about yablo's Paradox, a debated topic is the status of infinitary proofs. it is usually considered that, although a realist could (with some effort) accept them, an antirealist could not do it at all. in this paper i will argue that there are plausible reasons for ..."
Abstract
 Add to MetaCart
for an antirealist to accept infinitary proofs and rules of inference. Key WorDS: antirealism; realism; infinitary logic. Resumen en la discusión sobre la Paradoja de yablo, un tópico debatido es el estatus de las pruebas infinitarias. Se suele considerar que, aunque un realista podría (con cierto esfuerzo
On Modularity in Infinitary Term Rewriting
"... We study modular properties in strongly convergent infinitary term rewriting. In particular, we show that: • Confluence is not preserved across direct sum of a finite number of systems, even when these are noncollapsing. • Confluence modulo equality of hypercollapsing subterms is not preserved acro ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We study modular properties in strongly convergent infinitary term rewriting. In particular, we show that: • Confluence is not preserved across direct sum of a finite number of systems, even when these are noncollapsing. • Confluence modulo equality of hypercollapsing subterms is not preserved
An Infinitary Probability Logic for Type Spaces
, 2001
"... Type spaces in the sense of Harsanyi(1#EUOqql can be considered as the probabilistic analog of Kripke structures. By an infinitary propositionallanguage with additionaloperators "individuali assigns probability at least # to" and infinitary inference rules, we axiomatize the class of (Hars ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
Type spaces in the sense of Harsanyi(1#EUOqql can be considered as the probabilistic analog of Kripke structures. By an infinitary propositionallanguage with additionaloperators "individuali assigns probability at least # to" and infinitary inference rules, we axiomatize the class
NonDenumerable Infinitary Modal Logic
"... Abstract: Segerberg established an analogue of the canonical model theorem in modal logic for infinitary modal logic. However, the logics studied by Segerberg and Goldblatt are based on denumerable sets of pairs 〈Γ, α 〉 of sets Γ of wellformed formulae and wellformed formulae α. In this paper I sh ..."
Abstract
 Add to MetaCart
Abstract: Segerberg established an analogue of the canonical model theorem in modal logic for infinitary modal logic. However, the logics studied by Segerberg and Goldblatt are based on denumerable sets of pairs 〈Γ, α 〉 of sets Γ of wellformed formulae and wellformed formulae α. In this paper I
Infinitary Systems for the Modal muCalculus
"... Our work is concerned with the proof theoretic relationship between two infinitary deductive systems for the propositional modal µcalculus. The µcalculus is defined by the addition of least and greatest fixed point operators to (multi)modal logic. This results in a great increase in the expressive ..."
Abstract
 Add to MetaCart
approaches to define infinitary axiomatizations for the µcalculus. The first approach is to make use of socalled ω rules that have infinitely many premises to ensure that a fixed point is a least (or greatest) one. T ω µ+ is such a system studied in [2]. There, completeness of T ω µ+ is established
Invertible Infinitary Calculus without Loop Rules for a Restricted FFT
"... In the paper a fragment of first order linear time logic (with operators "next" and "always") is considered. The object under investigation in this fragment is socalled tDsequents. For considered tD sequents invertible infinitary sequent calculus G ! is constructed. Th ..."
Abstract
 Add to MetaCart
In the paper a fragment of first order linear time logic (with operators "next" and "always") is considered. The object under investigation in this fragment is socalled tDsequents. For considered tD sequents invertible infinitary sequent calculus G ! is constructed
S.: NonCommutative Infinitary Peano Arithmetic
 In: Proceedings of CSL 2011
, 2011
"... Does there exist any sequent calculus such that it is a subclassical logic and it becomes classical logic when the exchange rules are added? The first contribution of this paper is answering this question for infinitary Peano arithmetic. This paper defines infinitary Peano arithmetic with noncommut ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Does there exist any sequent calculus such that it is a subclassical logic and it becomes classical logic when the exchange rules are added? The first contribution of this paper is answering this question for infinitary Peano arithmetic. This paper defines infinitary Peano arithmetic with non
Weak Convergence and Uniform Normalization in Infinitary Rewriting
 In Proc. 20th Int. Conf. on Rewriting Techniques and Applications (RTA 2009), volume 6 of Leibniz International Proceedings in Informatics
, 2010
"... Abstract. We study infinitary term rewriting systems containing finitely many rules. For these, we show that if a weakly convergent reduction is not strongly convergent, it contains a term that reduces to itself in one step (but the step itself need not be part of the reduction). Using this result, ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Abstract. We study infinitary term rewriting systems containing finitely many rules. For these, we show that if a weakly convergent reduction is not strongly convergent, it contains a term that reduces to itself in one step (but the step itself need not be part of the reduction). Using this result
Results 1  10
of
61