Ricardo Monge

Mr. Ricardo Monge

orcid

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
15 February 2022 in Preprints.org
Verified
Preprint
Open access
PDF file
OSOsvaldo Skliar
Osvaldo Skliar
SGSherry Gapper
Sherry Gapper
RMRicardo Monge
Ricardo Monge
A description is provided of a method -- the Set Equality Method (SEM) -- to determine the validity, or lack of validity, of each categorical syllogism. A justification is given for the presentation of a new method to solve a problem which has already been solved using different approaches. First, the SEM assigns an equality of certain sets (or two of those equalities in specific cases as will be indicated) to each of the categorical propositions composing each syllogism considered -- that is, to each of the two premises and to the conclusion. Each syllogism considered is valid if and only if a) it is possible to select one of those equalities corresponding to one of the premises such that one of its members is a certain set and the other of those equalities corresponding to the other premise such that one of its members is a subset of the set mentioned, and b) it is possible to deduce an equality corresponding to the conclusion of the two equalities corresponding to the premises. In some cases, as will be specified, it is possible to provide a second test for the validity of a syllogism whose validity was already proven, thus providing information about the logical form of categorical syllogisms.

27 October 2018 in arXiv
Verified
Preprint
Open access
PDF file
OSOsvaldo Skliar
Osvaldo Skliar
SGSherry Gapper
Sherry Gapper
RMRicardo Monge
Ricardo Monge
A new cryptographic approach -- Iterated Random Encryption (IRE) -- is presented here. Although it is very simple, and easy to implement, it provides a very high level of security. According to this approach, a sequence of operations applied to a message ($M$) yields the encrypted message ($M_E$). In that series of operations, the one with the most important role is operation 6, which involves a random binary sequence (RBS) generated by using the Hybrid Random Number Generator (HRNG) or the Mathematical Random Number Generator (MRNG). A sequence of anti-operations applied to $M_E$ makes it possible to recover $M$.

21 February 2020 in arXiv
Verified
Preprint
Open access
PDF file
OSOsvaldo Skliar
Osvaldo Skliar
SGSherry Gapper
Sherry Gapper
RMRicardo Monge
Ricardo Monge
A characterization is provided for each natural number except one (1) by means of an ordered pair of elements. The first element is a natural number called the type of the natural number characterized, and the second is a natural number called the order of the number characterized within those of its type. A one-to-one correspondence is specified between the set of binary trees such that a) a given node has no child nodes (that is, it is a terminal node), or b) it has exactly two child nodes. Thus, binary trees such that one of their parent nodes has only one child node are excluded from the set considered here.