FAQFAQ   SearchSearch   MemberlistMemberlist   UsergroupsUsergroups 
 ProfileProfile   PreferencesPreferences   Log in to check your private messagesLog in to check your private messages   Log inLog in 
Forum index » Science and Technology » Math » Combinatorics
quantified expressions in isetl
Post new topic   Reply to topic Page 1 of 1 [2 Posts] View previous topic :: View next topic
Author Message
Kirsty
science forum beginner


Joined: 25 Oct 2005
Posts: 1

PostPosted: Tue Oct 25, 2005 4:32 am    Post subject: quantified expressions in isetl Reply with quote

help please!!!
a proper description of a function should include two sets: the domain
of possible input values and the target (sometimes called the codomain)
of possible output values. here is the complete description of one
particular function:

f : {0,1/2..15} is the input values
f2: {-10, -9..10} output values

a function is said to be onto if every element from the target set
actually occurs as an output for some element fromt the domain set.
write an isetl statement using quanitfiers to test wheter the function
is onto and run your statement
Back to top
Proginoskes
science forum Guru


Joined: 29 Apr 2005
Posts: 2593

PostPosted: Wed Oct 26, 2005 7:08 am    Post subject: Re: quantified expressions in isetl Reply with quote

Kirsty wrote:
Quote:
help please!!!
a proper description of a function should include two sets: the domain
of possible input values and the target (sometimes called the codomain)
of possible output values. here is the complete description of one
particular function:

f : {0,1/2..15} is the input values
f2: {-10, -9..10} output values

a function is said to be onto if every element from the target set
actually occurs as an output for some element fromt the domain set.
write an isetl statement using quanitfiers to test wheter the function
is onto and run your statement

What's an isetl? (I could do it in C, though ...)

--- Christopher Heckman
Back to top
Google

Back to top
Display posts from previous:   
Post new topic   Reply to topic Page 1 of 1 [2 Posts] View previous topic :: View next topic
The time now is Fri Jun 23, 2017 1:42 pm | All times are GMT
Forum index » Science and Technology » Math » Combinatorics
Jump to:  

Similar Topics
Topic Author Forum Replies Last Post
No new posts How does a CAS simplify complicated expressions? xyz91234@yahoo.com Symbolic 4 Tue Jul 18, 2006 12:59 am
No new posts Simplify boolean expressions eksamor Math 0 Thu Apr 20, 2006 11:41 am
No new posts Rings and valid expressions jstevh@msn.com Undergraduate 9 Thu Apr 13, 2006 12:30 am
No new posts [mupad] factor of complex expressions JH Symbolic 2 Thu Mar 16, 2006 1:28 pm
No new posts the expressions more readable.) This is determined by: <wr@wrelettronica.com& Electrochem 0 Mon Mar 13, 2006 12:50 am

Copyright © 2004-2005 DeniX Solutions SRL
Other DeniX Solutions sites: Electronics forum |  Medicine forum |  Unix/Linux blog |  Unix/Linux documentation |  Unix/Linux forums  |  send newsletters
 


Powered by phpBB © 2001, 2005 phpBB Group
[ Time: 0.0167s ][ Queries: 16 (0.0030s) ][ GZIP on - Debug on ]