1,738,621 research outputs found
Parikh and Wittgenstein
No full textA survey of Parikh’s philosophical appropriations of Wittgensteinian themes, placed into historical context against the backdrop of Turing’s famous paper, “On computable numbers, with an application to the Entscheidungsproblem” (Turing in Proc Lond Math Soc 2(42): 230–265, 1936/1937) and its connections with Wittgenstein and the foundations of mathematics. Characterizing Parikh’s contributions to the interaction between logic and philosophy at its foundations, we argue that his work gives the lie to recent presentations of Wittgenstein’s so-called metaphilosophy (e.g., Horwich in Wittgenstein’s metaphilosophy. Oxford University Press, Oxford, 2012) as a kind of “dead end” quietism. From early work on the idea of a feasibility in arithmetic (Parikh in J Symb Log 36(3):494–508, 1971) and vagueness (Parikh in Logic, language and method. Reidel, Boston, pp 241–261, 1983) to his more recent program in social software (Parikh in Advances in modal logic, vol 2. CSLI Publications, Stanford, pp 381–400, 2001a), Parikh’s work encompasses and touches upon many foundational issues in epistemology, philosophy of logic, philosophy of language, and value theory. But it expresses a unified philosophical point of view. In his most recent work, questions about public and private languages, opportunity spaces, strategic voting, non-monotonic inference and knowledge in literature provide a remarkable series of suggestions about how to present issues of fundamental importance in theoretical computer science as serious philosophical issues
Introduction
No full textThis is a collection of essays in honour of Professor Jyoti K. Parikh. Chapters in this book are written by prominent academics and practitioners who have had a professional connection with Professor Parikh during her long and distinguished career. The book engages with different dimensions of sustainable development and growth and presents a scholarly debate that is relevant to policy and research. The definition of sustainability has evolved considerably. An early definition of sustainable development was presented in the Brundtland Report in 1987, which defined sustainable development as the “development that meets the needs of the present generation without compromising the ability of future generations to meet their own needs”
Uniformly Parikh-friendly words
No full textParikh (vektör) dönüşümü biçimsel dil kuramının önemli kavramlarından biridir. Parikh vektörlerinde temel fikir kelimelerin özelliklerini vektörlerin nümerik özellikleri olarak ifade edebilmektir. Ancak kelimeleri vektörlere taşırken çok sayıda bilgi kaybolur. Bundan dolayı Parikh dönüşümünün genelleştirilmesi olan Parikh matris dönüşümü tanıtılmıştır. Bir kelimenin Parikh matrisi, o kelimenin bazı alt kelime sayıları ile ilgili bilgi veren bir üst üçgen matristir. Böyle bir matrisin ikinci köşegeninde Parikh vektörü oluşur. Genelleştirilmiş Parikh matris dönüşümü Parikh matris dönüşümünün genelleştirilmesidir ve Σk={a1The Parikh mapping (vector) is an important notion in the theory of formal languages. The basic idea behind Parikh vectors is that properties of words are expressed as numerical properties of vectors. However, much of the information is lost in the transition from words to vectors. Therefore, the Parikh matrix mapping which is a generalization of the Parikh mapping has been introduced. The Parikh matrix of a word is an upper triangular matrix which contains information on the number of occurences of certain subwords of that word. The Parikh vector will appear in such a matrix as the second diagonal. The generalized Parikh matrix mapping is extension of Parikh matrix mapping induced by a word instead of being defined with respect to an ordered alphabet Σk={a
Parikh - Do in-silico models provide improved risk prediction of drug-induced Torsades de Pointes?
No full textA talk given by Jaimit Parikh at the CiPA in-silico modelling satellite meeting to Cardiac Physiome Workshop, Toronto, November 2017
Extending Parikh q-matrices
No full textThe notion of extending Parikh q-matrix with respect to a word instead of an ordered alphabet is introduced. Some basic properties of this extending Parikh q-matrices have been investigated. Also it has been shown that the extending Parikh q-matrix mapping can be obtained as a composition of a Parikh q-matrix mapping and a word substitution morphism
A toolkit for Parikh matrices
No full textThe Parikh matrix mapping is a concept that provides information on the number of occurrences of certain (scattered) subwords in a word. Although Parikh matrices have been thoroughly studied, many of their basic properties remain open. In the present paper, we describe a toolkit that has been developed to support research in this field. Its functionality includes elementary and advanced operations related to Parikh matrices and the recently introduced variants of P -Parikh matrices and L -Parikh matrices.</p
Budhan Stories S2E10: Chhara Rap Song
No full textEpisode 10 of Season 2 was Chhara rap song where many Chhara people participated and displayed the bright side and dark side of Chhara people in Chharanagar. Created (Author) by: Keyur Bajrange. Participants: Budhan Theatre, Dakxin Chhara, Atish Indrekar, Ruchika Kodekar, Chetna Rathod, Kushal Batunge, Keyur Bajrange, Anish Garange, Siddharth Garange, Alice Tilche, Akshay Khanna, Yashodara Udupa, Chhara, Chharanagar, people of Chharanagar, Mohan Bajrange, Sulochanaben, Jonita Garange, Rajesh Bajrange.Supplementary materials include: short clips, poster and subtitles. </p
A toolkit for Parikh matrices
No full textThe Parikh matrix mapping is a concept that provides information on the number of occurrences of certain (scattered) subwords in a word. Although Parikh matrices have been thoroughly studied, many of their basic properties remain open. In the present paper, we describe a toolkit that has been developed to support research in this field. Its functionality includes elementary and advanced operations related to Parikh matrices and the recently introduced variants of P -Parikh matrices and L -Parikh matrices.</p
Generalized Parikh mappings and homomorphisms
No full textThe notion of the Parikh mapping is generalized by considering numbers of occurrences of segments of a fixed length instead of considering numbers of letters (i.e., segments of length one) only as is done in connection with the Parikh mappings. It is easily seen that the families of regular and context-free languages make difference with respect to these generalized Parikh mappings. On the other hand, properties of the Parikh mappings in connection with λ-free homomorphisms are, in general, preserved in the generalization
Generalizations of Parikh mappings
No full textParikh matrices have become a useful tool for investigation of subword
structure of words. Several generalizations of this concept have been
considered. Based on the concept of formal power series, we describe a general
framework covering most of these generalizations. In addition, we provide a
new characterization of binary amiable words – words having a common Parikh matrix
- …
