1 Introduction L-clausal forms is an interesting class of formulas in Eukasiewicz logic that was shown to be NP-complete[1].These formulas are defined over the following Lukasiewicz operations:negation-x=1-x strong di...
Supported by the National Natural Science Foundation of China(61433003,61273150);Beijing Higher Education Young Elite Teacher Project
A micro-extended-analog-computer (uEAC) is developed on the basis of Rubel' s extended analog computer(EAC) model. Through the uEAC mathematical model, the resistance properties of the conductive sheet, several f...
In this paper, we introduce generalized cyclic C-contractions through p number of subsets of a probabilistic metric space and establish two fixed point results for such contractions. In our first theorem we use the Ha...