Closure Properties of Weak Systems of Bounded Arithmetic

2005 ◽  
pp. 369-383 ◽  
Author(s):  
Antonina Kolokolova
Keyword(s):  
Bounded Arithmetic ◽  
Closure Properties

Multiple Regularity and Binary ETOL-Systems1

1981 ◽  
Vol 4 (1) ◽  
pp. 19-34
Author(s):  
Ryszard Danecki
Keyword(s):  
Equivalence Problem ◽  
Tree Automata ◽  
Closure Properties ◽  
Multiple Tree

Closure properties of binary ETOL-languages are investigated by means of multiple tree automata. Decidability of the equivalence problem of deterministic binary ETOL-systems is proved.

On metalinear ETOL systems

1980 ◽  
Vol 3 (1) ◽  
pp. 15-36
Author(s):  
Grzegorz Rozenberg ◽  
Dirk Vermeir
Keyword(s):  
Finite Index ◽  
Closure Properties ◽  
Pumping Lemma ◽  
L Systems ◽  
Structural Characterizations

The concept of metalinearity in ETOL systems is investigated. Some structural characterizations, a pumping lemma and the closure properties of the resulting class of languages are established. Finally, some applications in the theory of L systems of finite index are provided.

A Classification and Closure Properties of Languages for Describing Concurrent System Behaviours

1981 ◽  
Vol 4 (3) ◽  
pp. 531-549 ◽  
Author(s):  
Miklós Szijártó
Keyword(s):  
Formal Languages ◽  
Parallel Program ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
Concurrent System ◽  
Closure Properties ◽  
Sequential Program ◽  
Necessary And Sufficient ◽  
Special Case ◽  
Independence Relations

The correspondence between sequential program schemes and formal languages is well known (Blikle and Mazurkiewicz (1972), Engelfriet (1974)). The situation is more complicated in the case of parallel program schemes, and trace languages (Mazurkiewicz (1977)) have been introduced to describe them. We introduce the concept of the closure of a language on a so called independence relation on the alphabet of the language, and formulate several theorems about them and the trace languages. We investigate the closedness properties of Chomsky classes under closure on independence relations, and as a special case we derive a new necessary and sufficient condition for the regularity of the commutative closure of a language.

Partial Higher-Order Specifications1

1992 ◽  
Vol 16 (2) ◽  
pp. 101-126
Author(s):  
Egidio Astesiano ◽  
Maura Cerioli
Keyword(s):  
Sufficient Conditions ◽  
Higher Order ◽  
Necessary And Sufficient Conditions ◽  
Important Case ◽  
Deduction System ◽  
Closure Properties ◽  
Inference System ◽  
Conditional Specification ◽  
Necessary And Sufficient

In this paper the classes of extensional models of higher-order partial conditional specifications are studied, with the emphasis on the closure properties of these classes. Further it is shown that any equationally complete inference system for partial conditional specifications may be extended to an inference system for partial higher-order conditional specifications, which is equationally complete w.r.t. the class of all extensional models. Then, applying some previous results, a deduction system is proposed, equationally complete for the class of extensional models of a partial conditional specification. Finally, turning the attention to the special important case of termextensional models, it is first shown a sound and equationally complete inference system and then necessary and sufficient conditions are given for the existence of free models, which are also free in the class of term-generated extensional models.

Closure properties of the relevation transform*

1985 ◽  
Vol 32 (1) ◽  
pp. 185-189 ◽  
Author(s):  
J. G. Shanthikumar ◽  
Laurence A. Baxter
Keyword(s):  
Closure Properties

A note on the Σ1collection scheme and fragments of bounded arithmetic

2010 ◽  
Vol 56 (2) ◽  
pp. 126-130
Author(s):  
Zofia Adamowicz ◽  
Leszek Aleksander Kołodziejczyk
Keyword(s):  
Bounded Arithmetic

scholarly journals COMPLETELY REDUCIBLE SETS

2013 ◽  
Vol 23 (04) ◽  
pp. 915-941 ◽  
Author(s):  
DOMINIQUE PERRIN
Keyword(s):  
Closure Properties ◽  
Linear Representations ◽  
Complete Reducibility ◽  
The Family ◽  
Syntactic Representation ◽  
Completely Reducible ◽  
Rational Sets ◽  
Cyclic Sets

We study the family of rational sets of words, called completely reducible and which are such that the syntactic representation of their characteristic series is completely reducible. This family contains, by a result of Reutenauer, the submonoids generated by bifix codes and, by a result of Berstel and Reutenauer, the cyclic sets. We study the closure properties of this family. We prove a result on linear representations of monoids which gives a generalization of the result concerning the complete reducibility of the submonoid generated by a bifix code to sets called birecurrent. We also give a new proof of the result concerning cyclic sets.

New kinds of multidimensional IFR distribution

1990 ◽  
Vol 22 (1) ◽  
pp. 251-253 ◽  
Author(s):  
Yuedong Wang ◽  
Jinhua Cao
Keyword(s):  
Partial Order ◽  
Shock Model ◽  
Closure Properties ◽  
Increasing Function

Two kinds of multidimensional IFR distribution are defined by using a partial order in Rn+, which is derived from a non-negative, strictly increasing function in Rn+. Some closure properties under operations and an application to a shock model are discussed.

Pseudo-inversion: closure properties and decidability

2015 ◽  
Vol 15 (1) ◽  
pp. 31-39
Author(s):  
Da-Jung Cho ◽  
Yo-Sub Han ◽  
Shin-Dong Kang ◽  
Hwee Kim ◽  
Sang-Ki Ko ◽  
...  
Keyword(s):  
Closure Properties

Shape Memory Alloy Tufted Composites Combining High Delamination Resistant And Crack Closure Properties

2021 ◽  
pp. 106455
Author(s):  
Francesco Ciampa ◽  
Raj Ladani ◽  
Geoffrey Knott ◽  
Thibaut Buns ◽  
Andrew D. Foreman ◽  
...  
Keyword(s):  
Shape Memory Alloy ◽  
Shape Memory ◽  
Crack Closure ◽  
Closure Properties
Sign in / Sign up

Export Citation Format

Share Document